Torus网络中基于中心距离的完全自适应路由算法  

Fully Adaptive Routing in Torus Networks Based on Center Distance

作　　者：虞志刚[1] 向东[2] 王新玉[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084 [2]清华大学软件学院,北京100084

出　　处：《电子学报》2013年第11期2113-2119,共7页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61170063;No.60910003)

摘　　要：Torus网络凭借其优越的结构特性,引起了工业界和学术界的广泛关注.高效、无死锁的路由算法设计是互连网络研究的一个重要方面.针对Torus网络实现自适应路由所需虚通道数目多的缺点,提出了自适应路由算法Gear,该算法基于中心距离的方法来限制虚通道的使用,在虚切通交换下仅需两条虚通道即可为Torus网络提供无死锁自适应路由.通过仿真对所提算法的有效性进行了验证,结果表明,在同等情况下算法Gear的性能较经典的维序路由和Duato协议具有非常明显的优势.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 imple-ments 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 .

关 键 词：TORUS网络 路由算法 虚通道 自适应路由 

分 类 号：TN915.5[电子电信—通信与信息系统]