G-CARA: A Global Congestion-Aware Routing Algorithm for traffic management in 3D networks-on-chip
G-CARA: A Global Congestion-Aware Routing Algorithm for traffic management in 3D networks-on-chip
复制标题
G-CARA：用于 3D 片上网络中流量管理的全局拥塞感知路由算法
DOI：
10.1109/iraniancee.2017.7985425
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Hadi Shahriar Shahhoseini
中科院分区：
文献类型：
--
作者：
Nooshin Nosrati;Hadi Shahriar Shahhoseini
拥塞感知路由算法通过在源路由器和目的路由器之间选择拥塞较少的路径来提高网络性能。本文提出了一种用于三维片上网络（3D noc）交通管理的全局感知拥塞路由算法（G-CARA）。该方法有效地将数据包转发到流量较小的区域，避免了网络拥塞。这个过程分为两步。该算法首先收集网络各层的全局拥塞信息，然后利用这些信息根据维序路由指定发送数据包的最优路径。全局拥塞值是通过在包的报头流中嵌入流量信息来传播的。在此基础上，利用转弯模型保证了路由算法的无死锁性。实验结果表明，G-CARA在饱和点和平均延迟上的平均改善幅度分别为14% ~ 22%和42% ~ 61%。
Congestion-aware routing algorithms improve the network performance by selecting less congested paths between source and destination routers. In this paper, a Global Congestion-Aware Routing Algorithm (G-CARA) is proposed for traffic management in three-dimensional Networks-on-Chip (3D NoCs). The proposed method forwards data packets efficiently toward regions with lower traffic to avoid network congestion. This is done by two steps. At first, the algorithm collects global congestion information in each layer of the network, and then, the algorithm utilizes the incoming information to specify an optimal path for sending a packet based on dimension-order routing. Global congestion values are propagated by embedded traffic information in header flit of packets. Furthermore, turn models are used to guarantee deadlock-freedom in proposed routing algorithm. Experimental results show that G-CARA can achieve an improvement in both saturation point and average latency within the range of 14%–22% and 42%–61% on average, respectively.