PathAware: A contention-aware selection function for application-specific Network-On-Chips

Behrad Niazmand, M. Reshadi, A. Reza
{"title":"PathAware: A contention-aware selection function for application-specific Network-On-Chips","authors":"Behrad Niazmand, M. Reshadi, A. Reza","doi":"10.1109/NORCHP.2012.6403149","DOIUrl":null,"url":null,"abstract":"Network-on-Chip (NoC) has been introduced as a novel solution to overcome the constraints met in on-chip interconnection networks. Performance of NoCs is one of the important concerns of researchers and designers. One of the factors that can affect performance in on-chip networks is the occurrence of congestion when routing packets. In this paper we introduce an output selection function, named “PathAware”, which can be exploited with any adaptive routing algorithm. The main purpose is to address the situations in which more multiple output ports are chosen as candidates and to reduce latency and balance traffic load by selecting the appropriate output port leading to a minimal path. In order to avoid deadlock, we have exploited turn model adaptive routing algorithms. Simulation results demonstrate that when using “PathAware” selection function along with “West-First” and “Odd-Even” adaptive routing algorithms, it can outperform “Random”, “Buffer-Level” and “Neighboron-Path” selection functions in terms of latency and an improvement of 41% can be achieved (in best case), while imposing a negligible overhead on energy consumption.","PeriodicalId":332731,"journal":{"name":"NORCHIP 2012","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NORCHIP 2012","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NORCHP.2012.6403149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Network-on-Chip (NoC) has been introduced as a novel solution to overcome the constraints met in on-chip interconnection networks. Performance of NoCs is one of the important concerns of researchers and designers. One of the factors that can affect performance in on-chip networks is the occurrence of congestion when routing packets. In this paper we introduce an output selection function, named “PathAware”, which can be exploited with any adaptive routing algorithm. The main purpose is to address the situations in which more multiple output ports are chosen as candidates and to reduce latency and balance traffic load by selecting the appropriate output port leading to a minimal path. In order to avoid deadlock, we have exploited turn model adaptive routing algorithms. Simulation results demonstrate that when using “PathAware” selection function along with “West-First” and “Odd-Even” adaptive routing algorithms, it can outperform “Random”, “Buffer-Level” and “Neighboron-Path” selection functions in terms of latency and an improvement of 41% can be achieved (in best case), while imposing a negligible overhead on energy consumption.
PathAware:针对特定应用的片上网络的竞争感知选择功能
片上网络(NoC)作为一种克服片上互连网络所遇到的限制的新解决方案被引入。noc的性能是研究人员和设计人员关注的重要问题之一。影响片上网络性能的因素之一是在路由数据包时发生拥塞。在本文中,我们引入了一个名为“路径感知”的输出选择函数,它可以被任何自适应路由算法利用。其主要目的是解决选择多个输出端口作为候选端口的情况,并通过选择通向最小路径的适当输出端口来减少延迟和平衡流量负载。为了避免死锁,我们开发了回合模型自适应路由算法。仿真结果表明,当使用“PathAware”选择功能与“西优先”和“奇偶”自适应路由算法时,它可以在延迟方面优于“Random”,“Buffer-Level”和“neighbor - path”选择功能,并且可以实现41%的改进(在最佳情况下),而对能耗的影响可以忽略不计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信