Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection

In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. Based on the concept of unsafe nodes, we design a routing algorithm for hypercubes that can tolerate at least n , 1 node faults and can route a message via a path of length no more than the Hamming distance between the source and destination plus four. We also develop a routing algorithm for meshes that can tolerate any block faults, as long as the distance between any two nodes in di erent faulty blocks is at least 2 in each dimension.

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Jau-Der Shih
• Keywords: Distributed And Parallel Computing, Fault-tolerant Deadlock-free Routing, IPPS 1997, Routing Algorithm, Virtual Channels