故障超立方体网络中的路由算法  

Fault tolerant routing algorithm on hypercube networks

作　　者：李银[1] 梁家荣[1] 

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

出　　处：《计算机工程与应用》2009年第18期120-122,208,共4页Computer Engineering and Applications

基　　金：国家自然科学基金No.60564001;国家教育部新世纪人才支持计划No.NCET-06-0756~~

摘　　要：针对超立方体结构的多处理机系统中存在故障的情况,提出了一个应用于超立方体网络的容错路由算法。该容错路由算法是基于局部信息的,只需要知道邻节点的状态,而无需知道整个网络的运行情况。对于给定的源节点和目的节点,路由算法均能够找到一条最优通路,并且可以预防死锁。模拟实验结果表明,路由算法所构造的路径长度接近于两个节点之间的最优路径长度。In order to deal with the increasing fault possibility of computers and links in hypercube multi-computer system,a novel and simple fault tolerant routing algorithm is proposed.The algorithm is based on local information,each node knows only its neighbors＇ status no matter what the status of others.Moreover,the algorithms can find a better-path between source node and destination node.Simulation results show that the length of the routing path constructed by this algorithm is very close to the optimal length.

关 键 词：超立方体网络 容错 空闲维 

分 类 号：TP302.8[自动化与计算机技术—计算机系统结构]