Efficient Algorithm for Adaptive Routing in Three-Dimensional Meshes

摘要：

　　Routing algorithm with more flexibility and fewer virtual channels is essential for high performance multicomputer systems.For three-dimensional mesh-connected networks,the traditional planar-adaptive routing algorithm requires three virtual channels to provide two-dimensional adaptivity.In this paper,a partially three-dimensional-adaptive routing algorithm is proposed for mesh-connected networks.The proposed algorithm utilizes at most two virtual channels for adaptive routing.Flit-level simulations are conducted to compare the proposed algorithm and two existing solutions.The simulation result shows that the proposed algorithm is superior to existing ones for nonuniform traffic patterns and apparently reduces the average packet latency.

关键词： three-dimensional meshes routing algorithm planer-adaptive deadlock-free

作者: Xinming Duan Jinghao Guo Jigang Wu

作者单位: School of Computer Science and Software,Tianjin Polytechnic University,Tianjin 300387,China

会议类型: 国内会议

会议名称: 2014全国理论计算机科学学术年会

会议地点: 济南

会议语种:英文

页码: 1-8

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