A Degree Priority Routing Algorithm for Irregular Mesh Topology NoCs

摘要：

In this paper,a degree priority routing algorithm is proposed to minimize the hardware cost for nonregular mesh network-on-chip. In the algorithm,the routing path is dynamically selected with respective to the communication status of the next hop node. The next hop node concluded by the degree prioriO,routing different with them obtained by routing algorithm are inserted in the routing table. And,the items in the routing table that have the same contents are combined to further minimize the area and power. Experimental results show that the proposed algorithm has better performance than other three routing algorithms.

作者: Ling Wang Hui Song Dongxin Wen Yingtao Jiang

作者单位: Department of Computer Science & Technology Harbin Institute of Technology Harbin,Heilongjiang P.R.C Department of Electrical & Computer Engineering University of Nevada Las Vegas Las Vegas,NV 89154 US

会议类型: 国际会议

会议名称: The 2008 International Conference on Embedded Software and Systems Symposia(ICESS 2008)(2008国际嵌入式系统及嵌入式软件会议)

会议地点: 成都

会议语种:英文

页码: 293-297

在线出版日期: 2008-01-01（万方平台首次上网日期，不代表论文的发表时间）