交换超立方网的自适应性无死锁路由算法  

An adaptive deadlock-free routing algorithm in the exchanged hypercube

作　　者：曹入辉[1] 梁家荣[1] 王新阳[1] 豆秋丽[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《计算机工程与科学》2013年第2期13-17,共5页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(61064002);教育部新世纪优秀人才支持计划专项资助项目(NCET-06-0756)

摘　　要：交换超立方网是一种新提出来的互连网络。首先,利用图论的方法研究了交换超立方网的拓扑性质,引入了相似子网的概念,得出相似子网和超立方体同构的结论;然后,利用将物理通道分成两条虚拟通道的方法,给出了一种交换超立方网的自适应性路由算法,并从理论上证明了该算法的无死锁性。The exchanged hypercube is a novel interconnection network. Firstly, the method of graph theory is employed to analyze the topological property of the exchanged hypercube, the concept of similar subnet is defined and the result that the hypercube and the similar subnet are isomorphic is obtained. Secondly, an adaptive routing algorithm is proposed by using the technique of dividing a physical channel into two virtual channels. Finally, the theoretical analysis shows that the algorithm is deadlockfree.

关 键 词：交换超立方网 无死锁路由 虚拟网络 P-cube算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]