This Article 
 Bibliographic References 
 Add to: 
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
November 1995 (vol. 6 no. 11)
pp. 1147-1152

Abstract—This paper presents a partially adaptive fault-tolerant routing algorithm for hypercube multicomputers. The algorithm is tolerant to n− 1 link and/or node faults for an n-cube. It makes routing decisions adaptively based on local failure information only. It is simple to implement and needs a very small message overhead. A comparison between the algorithm and a popular previous work is given.

[1] M.-S. Chen and K.G. Shin, "Adaptive Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Trans. Computers, vol. 39, no. 12, pp. 1,406-1,416, Dec. 1990.
[2] J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
[3] P.T. Gaughan and S. Yalamanchili, “Adaptive Routing Protocols for Hypercube Interconnection Networks,” Computer, vol. 26, no. 5, pp. 12–23, May 1993.
[4] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
[5] P. Kermani and L. Kleinrock,“Virtual cut-through: A new computer communication switching technique,” Computer Networks, vol. 3, pp. 267-286, 1979.
[6] T.C. Lee and J.P. Hayes,“A fault-tolerant communication scheme for hypercube computers,” IEEE Trans. Computers, vol. 41, no. 10, pp. 1,242-1,256, Oct. 1992.
[7] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[8] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.

Index Terms:
Adaptive routing, fault-tolerant computing, hypercubes, multicomputers, interconnection networks.
Youran Lan, "An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 11, pp. 1147-1152, Nov. 1995, doi:10.1109/71.476186
Usage of this product signifies your acceptance of the Terms of Use.