M. Ebrahimi, Xin Chang, M. Daneshtalab, J. Plosila, P. Liljeberg, H. Tenhunen
{"title":"DyXYZ: Fully Adaptive Routing Algorithm for 3D NoCs","authors":"M. Ebrahimi, Xin Chang, M. Daneshtalab, J. Plosila, P. Liljeberg, H. Tenhunen","doi":"10.1109/PDP.2013.80","DOIUrl":null,"url":null,"abstract":"Traditional methods in 3D NoCs simply use a deterministic routing algorithm to deliver packets from a source to a destination node. However, deterministic methods are unable to distribute the traffic load over the network, which results in degrading the performance. In this paper, we present a fully adaptive routing algorithm for 3D NoCs, named DyXYZ. In DyXYZ, the congestion information at the input buffer of the neighboring routers is used as congestion metric to select among the output channels. This algorithm is proven to be deadlock free by using 4, 4, and 2 virtual channels along the X, Y, and Z dimensions, respectively.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"19 7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDP.2013.80","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35
Abstract
Traditional methods in 3D NoCs simply use a deterministic routing algorithm to deliver packets from a source to a destination node. However, deterministic methods are unable to distribute the traffic load over the network, which results in degrading the performance. In this paper, we present a fully adaptive routing algorithm for 3D NoCs, named DyXYZ. In DyXYZ, the congestion information at the input buffer of the neighboring routers is used as congestion metric to select among the output channels. This algorithm is proven to be deadlock free by using 4, 4, and 2 virtual channels along the X, Y, and Z dimensions, respectively.
3D noc的传统方法只是使用确定性路由算法将数据包从源节点传递到目标节点。然而,确定性方法无法在网络上分配流量负载,从而导致性能下降。在本文中,我们提出了一种3D noc的完全自适应路由算法,命名为DyXYZ。在DyXYZ中,相邻路由器的输入缓冲区的拥塞信息被用作拥塞度量来选择输出通道。通过在X、Y和Z维度上分别使用4、4和2个虚拟通道,可以证明该算法没有死锁。