蜂窝网络上的虫孔容错路由算法  

Fault-tolerant Wormhole Routing Algorithm for Honeycomb Networks

作　　者：张伟文[1] 杨小帆[1] 林玮[1] 张向斌[1] 

机构地区：[1]重庆大学计算机学院,重庆400030

出　　处：《重庆大学学报（自然科学版）》2007年第4期102-107,共6页Journal of Chongqing University

基　　金：教育部新世纪优秀人才资助计划(NCET-05-0759);教育部博士点基金(20050611001);重庆市自然科学基金(CSTC2005;BB2191)

摘　　要：蜂窝网络是新近提出的并行多处理机互连网络结构.针对该网络提出了一个无故障最短路径单播路由算法,然后基于该算法使用虚拟信道技术设计了一个凸形故障容错路由算法.这2个算法都是无死锁的,容错路由算法也只使用局部信息路由报文.Honeycomb meshes are topological structures for connecting processors within parallel computers. The unicast routing strategy on honeycomb meshes are studied. It is indicated that a previous known routing algorithm may suffer from deadlock. A deadlock-free routing algorithm known as the XYZ-ROUTE algorithm is presented by employing the classical virtual channel technique. This algorithm is improved to make it work properly in the presence of convex faults.

关 键 词：互连网络 蜂窝网络 容错 虫孔路由 凸形故障 

分 类 号：TP338[自动化与计算机技术—计算机系统结构] TP393[自动化与计算机技术—计算机科学与技术]