一种适用于2D Mesh NoC的低延迟路由算法

Low-latency Routing Algorithm for 2D Mesh NoC

在2D mesh结构的片上网络(NoC)中,传统的"逻辑电路式"路由算法都是采用"一步一比较"的方式确定最优输出端口,这种方式不能有效的降低数据包的平均延迟.根据数据包在2D mesh NoC某些连续的跳数内最优端口固定的特点,提出了一种低延迟、无死锁的路由算法,该算法采用"跳步比较"的方式来降低数据包的路由时间.实验结果表明,和改进的DyAD算法相比,该算法使得平均延迟和网络总功耗分别平均改善3.4%和7.4%,算法在大尺寸NoC中低延迟的优势更为明显.

As using the way of ＂hop-by-hop comparison＂ to determine the optimal output ports in 2D mesh NoC, conventional ＂logic circuit-based＂ routing algorithms can not reduce the average latency of packets effectively. According to the feature that packets in 2D mesh NoC have fixed optimal ports in several successive hops, this paper proposes a low-latency and deadlock-free routing algorithm, which adopts the technique of ＂hop-spanning comparison＂ to reduce routing time of packets. Compared with the improved DyAD al- gorithm, the experiment results demonstrate that proposed algorithm can improve the average latency and total power consumption by 3.4% and 7.4% in average, respectively. Meanwhile, with regard to the average latency in large-sized NoC, the advantage of the algorithm is more prominent.