Fully Adaptive Routing in Torus Networks Based on Center Distance
YU Zhi-gan · Dianzi xuebao · 2013
Torus networks win lots of industrial and academic attention by virtue of the superior architecture proprieties.The design of efficient deadlock-free routing algorithms is an important aspect of interconnection networks research.Against the problem that torus networks need numbers of virtual channels to support adaptive routing, we propose an adaptive routing algorithm:Gear, which needs only 2 virtual channels to support deadlock-free adaptive routing in Virtual Cut-Through switched Torus.Gear implements fully adaptive routing by constraining the use of some special virtual channels on the concept of Center Distance.We verify the efficiency of the algorithm with simulation. The results show that,in the same circumstances,the advantage of proposed Gear over classic Dimension-Order Routing and Duato′s Protocol is very apparent.