计算机工程 ›› 2007, Vol. 33 ›› Issue (09): 12-14,1.

• 博士论文 • 上一篇    下一篇

基于PRDT的16节点NoC路由算法

段新明1,杨愚鲁1,杨 梅2   

  1. (1. 南开大学信息技术科学学院,天津 300071;2. 美国内华达大学电子&计算机工程学院,拉斯维加斯 NV89154)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-05-05 发布日期:2007-05-05

NoC Routing Algorithm Based on 16-node PRDT

DUAN Xinming1, YANG Yulu1, YANG Mei2   

  1. (1. College of Information Technical Science, Nankai University, Tianjin 300071; 2. College of Electrical & Computer Engineering, University of Nevada, Las Vegas NV89154)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-05-05 Published:2007-05-05

摘要: 网络结构对于片上网络系统的性能和功耗发挥着重要作用,PRDT(2,1)有着较低的网络直径和平均距离、常数的节点度以及良好的可扩展性,这些特点使其非常适于NoC。为了提高小规模PRDT的路由性能,该文提出了一种binary路由算法,当网络规模不大于16时,该算法无须使用虚拟通道即可实现无死锁路由,通过增加少量虚拟通道,可改进为完全自适应路由算法。对所提出的路由算法与原有的向量路由算法进行仿真比较,结果显示binary算法在硬件成本较低的同时,性能更为优异,完全可以应用于基于PRDT的小规模NoC网络。

关键词: 片上网络, PRDT网络, 路由算法, 无死锁

Abstract:

The interconnection network plays an important role in performance and energy consumption of a Network-on-chip(NoC) system. PRDT(2,1) is a promising solution for the interconnection network of NoC due to its smaller diameter and average distance, constant node degree and full scalability. In this paper, a binary routing algorithm for PRDT is presented in order to improve the performance of routing for PRDT with small size. In the case that PRDT consists of no more than 16 nodes, the binary algorithm is deadlock-free without the utilization of virtual channels. Based on the binary algorithm, it proposes a fully adaptive routing algorithm which is deadlock-free by using a few virtual channels. The comparison between the deterministic, adaptive binary algorithm and the original vector algorithm is conducted in a simulation. The results show that the binary algorithm is better in performance while its hardware cost is lower. So the algorithm is readily applicable to the small PRDT-based NoC systems.

Key words: Network-on-chip(NoC), PRDT network, Routing algorithm, Deadlock-free

中图分类号: