Contention-avoiding custom topology generation for network-on-chip

S. Deniziak, R. Tomaszewski
{"title":"Contention-avoiding custom topology generation for network-on-chip","authors":"S. Deniziak, R. Tomaszewski","doi":"10.1109/DDECS.2009.5012136","DOIUrl":null,"url":null,"abstract":"In this paper we present a methodology for custom topology generation, offering low latency and significantly reduced power consumption. The novelty of our approach lies in the objective - we focus on complete elimination of the contention on the links. It is achieved through alternate path generation, insertion of additional links and message scheduling. We also present a novel concept of Message Dependence Graph for traffic analysis. The methodology operates under application and design constraints, producing network topology along with routing paths. Experimental results confirming benefits of the proposed approach are provided.","PeriodicalId":6325,"journal":{"name":"2009 12th International Symposium on Design and Diagnostics of Electronic Circuits & Systems","volume":"22 1","pages":"234-237"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 12th International Symposium on Design and Diagnostics of Electronic Circuits & Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DDECS.2009.5012136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper we present a methodology for custom topology generation, offering low latency and significantly reduced power consumption. The novelty of our approach lies in the objective - we focus on complete elimination of the contention on the links. It is achieved through alternate path generation, insertion of additional links and message scheduling. We also present a novel concept of Message Dependence Graph for traffic analysis. The methodology operates under application and design constraints, producing network topology along with routing paths. Experimental results confirming benefits of the proposed approach are provided.
为片上网络生成避免冲突的自定义拓扑
在本文中,我们提出了一种自定义拓扑生成方法,提供低延迟和显着降低功耗。我们的方法的新颖性在于目标-我们专注于完全消除链路上的争用。它是通过生成备用路径、插入附加链接和消息调度来实现的。我们还提出了一个用于流量分析的消息依赖图的新概念。该方法在应用和设计约束下运行,生成网络拓扑以及路由路径。实验结果证实了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信