基于奇偶的网状noc自适应双向路由热点缓解

R. Raj, C. Gayathri, Saidalavi Kalady, P. Jayaraj
{"title":"基于奇偶的网状noc自适应双向路由热点缓解","authors":"R. Raj, C. Gayathri, Saidalavi Kalady, P. Jayaraj","doi":"10.1145/3288599.3288611","DOIUrl":null,"url":null,"abstract":"Network-on-Chip is adapted as a profitable framework for communication in on-chip multiprocessors. Congestion management using adaptive routing techniques become the major research focus in recent days. Hotspots are congested cores in multi-core systems, which has to deal with large amount of packetized data than other cores in the network. When a packet has to pass through hotspots, it will adversely affect the overall system performance. We identify the hotspot cores using counters, and propose an adaptive two-way routing algorithm by restricting some routes as in odd-even turn model to handle the presence of hotspots. The algorithm designed not only de-routes packets from current hotspots, but also reduces the possibility of nearby hotspots formation in the future. Experimental results using SPEC 2006 CPU benchmarks show that the chances of hotspots are large in highly congested traffic, and our algorithm gives about 14% average reduction in packet latency than existing routing methods in presence of hotspot cores.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Odd-even based adaptive two-way routing in mesh NoCs for hotspot mitigation\",\"authors\":\"R. Raj, C. Gayathri, Saidalavi Kalady, P. Jayaraj\",\"doi\":\"10.1145/3288599.3288611\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network-on-Chip is adapted as a profitable framework for communication in on-chip multiprocessors. Congestion management using adaptive routing techniques become the major research focus in recent days. Hotspots are congested cores in multi-core systems, which has to deal with large amount of packetized data than other cores in the network. When a packet has to pass through hotspots, it will adversely affect the overall system performance. We identify the hotspot cores using counters, and propose an adaptive two-way routing algorithm by restricting some routes as in odd-even turn model to handle the presence of hotspots. The algorithm designed not only de-routes packets from current hotspots, but also reduces the possibility of nearby hotspots formation in the future. Experimental results using SPEC 2006 CPU benchmarks show that the chances of hotspots are large in highly congested traffic, and our algorithm gives about 14% average reduction in packet latency than existing routing methods in presence of hotspot cores.\",\"PeriodicalId\":346177,\"journal\":{\"name\":\"Proceedings of the 20th International Conference on Distributed Computing and Networking\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 20th International Conference on Distributed Computing and Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3288599.3288611\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 20th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3288599.3288611","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

片上网络被适应为片上多处理器通信的有利框架。采用自适应路由技术进行拥塞管理已成为近年来研究的热点。热点是多核系统中的拥塞核心,与网络中的其他核心相比,热点需要处理大量的分组数据。当数据包需要经过热点时,会对系统的整体性能产生不利影响。我们利用计数器识别热点核,并提出了一种自适应双向路由算法,通过限制奇偶轮模型中的一些路由来处理热点的存在。该算法不仅使数据包脱离当前热点,而且减少了未来在附近形成热点的可能性。使用spec2006 CPU基准测试的实验结果表明,在高度拥塞的流量中出现热点的可能性很大,并且在存在热点核心的情况下,我们的算法比现有路由方法平均减少了14%的数据包延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Odd-even based adaptive two-way routing in mesh NoCs for hotspot mitigation
Network-on-Chip is adapted as a profitable framework for communication in on-chip multiprocessors. Congestion management using adaptive routing techniques become the major research focus in recent days. Hotspots are congested cores in multi-core systems, which has to deal with large amount of packetized data than other cores in the network. When a packet has to pass through hotspots, it will adversely affect the overall system performance. We identify the hotspot cores using counters, and propose an adaptive two-way routing algorithm by restricting some routes as in odd-even turn model to handle the presence of hotspots. The algorithm designed not only de-routes packets from current hotspots, but also reduces the possibility of nearby hotspots formation in the future. Experimental results using SPEC 2006 CPU benchmarks show that the chances of hotspots are large in highly congested traffic, and our algorithm gives about 14% average reduction in packet latency than existing routing methods in presence of hotspot cores.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信