A fast algorithm for runtime reconfiguration to maximize the lifetime of nanoscale NoCs

F. Triviño, D. Bertozzi, J. Flich
{"title":"A fast algorithm for runtime reconfiguration to maximize the lifetime of nanoscale NoCs","authors":"F. Triviño, D. Bertozzi, J. Flich","doi":"10.1145/2482759.2482760","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a fast algorithm to reprogram the routing function of an on-chip network (NoC) at runtime. This reconfiguration algorithm comes with the following key novelties. First, it deals with the lack of routing tables, which are poorly scalable and lengthy to reconfigure. Second, it can deal with any number of faults that might be progressively detected over time (i.e., full coverage of fault patterns). Third, it preserves ultra-fast reconfiguration times even for the most challenging scenarios.","PeriodicalId":142364,"journal":{"name":"IMA-OCMC '13","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IMA-OCMC '13","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2482759.2482760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, we propose a fast algorithm to reprogram the routing function of an on-chip network (NoC) at runtime. This reconfiguration algorithm comes with the following key novelties. First, it deals with the lack of routing tables, which are poorly scalable and lengthy to reconfigure. Second, it can deal with any number of faults that might be progressively detected over time (i.e., full coverage of fault patterns). Third, it preserves ultra-fast reconfiguration times even for the most challenging scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种优化纳米noc运行时重构的快速算法
在本文中,我们提出了一个快速的算法来重新编程一个片上网络(NoC)的路由功能在运行时。这种重新配置算法具有以下关键的新颖之处。首先,它解决了缺乏路由表的问题,路由表的可扩展性很差,重新配置也很长。其次,它可以处理随时间逐渐检测到的任意数量的故障(即,故障模式的完全覆盖)。第三,即使在最具挑战性的场景下,它也能保持超快的重新配置时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
NBTI-aware design of NoC buffers A fast algorithm for runtime reconfiguration to maximize the lifetime of nanoscale NoCs Arbitration of many thousand flows at 100G and beyond Randomizing task placement does not randomize traffic (enough) Global misrouting policies in two-level hierarchical networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1