基于二维网格拓扑负载变化的
所选路由算法的性能对比分析
片上网络

Mohammed Shaba Saliu, Muyideen Omuya Momoh, Pascal Uchenna Chinedu, W. Nwankwo, Aliu Daniel
{"title":"基于二维网格拓扑负载变化的\u2028所选路由算法的性能对比分析\u2028片上网络","authors":"Mohammed Shaba Saliu, Muyideen Omuya Momoh, Pascal Uchenna Chinedu, W. Nwankwo, Aliu Daniel","doi":"10.11113/elektrika.v20n3.249","DOIUrl":null,"url":null,"abstract":"Network-on-Chip (NoC) has been proposed as a viable solution to the communication challenges on System-on-Chips (SoCs). As the communication paradigm of SoC, NoCs performance depends mainly on the type of routing algorithm chosen. In this paper different categories of routing algorithms were compared. These include XY routing, OE turn model adaptive routing, DyAD routing and Age-Aware adaptive routing.  By varying the load at different Packet Injection Rate (PIR) under random traffic pattern, comparison was conducted using a 4 × 4 mesh topology. The Noxim simulator, a cycle accurate systemC based simulator was employed. The packets were modeled as a Poisson distribution; first-in-first-out (FIFO) input buffer channel with a depth of five (5) flits and a flit size of 32 bits; and a packet size of 3 flits respectively. The simulation time was 10,000 cycles. The findings showed that the XY routing algorithm performed better when the PIR is low.  In a similar vein, the DyAD routing and Age-aware algorithms performed better when the load i.e. PIR is high.","PeriodicalId":312612,"journal":{"name":"ELEKTRIKA- Journal of Electrical Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Comparative Performance Analysis of \\u2028Selected Routing Algorithms by Load Variation of 2-Dimensional Mesh Topology Based \\u2028Network-On-Chip\",\"authors\":\"Mohammed Shaba Saliu, Muyideen Omuya Momoh, Pascal Uchenna Chinedu, W. Nwankwo, Aliu Daniel\",\"doi\":\"10.11113/elektrika.v20n3.249\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network-on-Chip (NoC) has been proposed as a viable solution to the communication challenges on System-on-Chips (SoCs). As the communication paradigm of SoC, NoCs performance depends mainly on the type of routing algorithm chosen. In this paper different categories of routing algorithms were compared. These include XY routing, OE turn model adaptive routing, DyAD routing and Age-Aware adaptive routing.  By varying the load at different Packet Injection Rate (PIR) under random traffic pattern, comparison was conducted using a 4 × 4 mesh topology. The Noxim simulator, a cycle accurate systemC based simulator was employed. The packets were modeled as a Poisson distribution; first-in-first-out (FIFO) input buffer channel with a depth of five (5) flits and a flit size of 32 bits; and a packet size of 3 flits respectively. The simulation time was 10,000 cycles. The findings showed that the XY routing algorithm performed better when the PIR is low.  In a similar vein, the DyAD routing and Age-aware algorithms performed better when the load i.e. PIR is high.\",\"PeriodicalId\":312612,\"journal\":{\"name\":\"ELEKTRIKA- Journal of Electrical Engineering\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ELEKTRIKA- Journal of Electrical Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11113/elektrika.v20n3.249\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ELEKTRIKA- Journal of Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11113/elektrika.v20n3.249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

片上网络(NoC)已被提出作为解决片上系统(soc)通信挑战的可行方案。noc作为SoC的通信范式,其性能主要取决于所选择的路由算法类型。本文对不同类型的路由算法进行了比较。其中包括XY路由、OE转弯模型自适应路由、DyAD路由和年龄感知自适应路由。在随机流量模式下,通过改变不同包注入率(PIR)下的负载,采用4 × 4网格拓扑进行比较。采用了基于循环精度系统的模拟器——Noxim模拟器。包被建模为泊松分布;先进先出(FIFO)输入缓冲通道,其深度为五(5)个飞位,飞位大小为32位;和包大小分别为3个flits。模拟时间为10,000个周期。结果表明,当PIR较低时,XY路由算法的性能较好。同样,当负载(即PIR)较高时,DyAD路由和年龄感知算法表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparative Performance Analysis of 
Selected Routing Algorithms by Load Variation of 2-Dimensional Mesh Topology Based 
Network-On-Chip
Network-on-Chip (NoC) has been proposed as a viable solution to the communication challenges on System-on-Chips (SoCs). As the communication paradigm of SoC, NoCs performance depends mainly on the type of routing algorithm chosen. In this paper different categories of routing algorithms were compared. These include XY routing, OE turn model adaptive routing, DyAD routing and Age-Aware adaptive routing.  By varying the load at different Packet Injection Rate (PIR) under random traffic pattern, comparison was conducted using a 4 × 4 mesh topology. The Noxim simulator, a cycle accurate systemC based simulator was employed. The packets were modeled as a Poisson distribution; first-in-first-out (FIFO) input buffer channel with a depth of five (5) flits and a flit size of 32 bits; and a packet size of 3 flits respectively. The simulation time was 10,000 cycles. The findings showed that the XY routing algorithm performed better when the PIR is low.  In a similar vein, the DyAD routing and Age-aware algorithms performed better when the load i.e. PIR is high.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信