This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers
August 1997 (vol. 46 no. 8)
pp. 953-958

Abstract—The concept of routing capability is proposed to assist fault-tolerant routing in hypercubes. Routing capability is defined with respect to the entire spectrum of distance. As a result, the amount of information that is useful for message routing is increased. An algorithm is presented to facilitate efficient fault-tolerant routing of messages. The algorithm routes a message in an attempt to minimize derouting. Furthermore, the concept of directed routing capability which contains more useful information for fault-tolerant routing is introduced. Simulation results demonstrate the usefulness of our approach.

[1] P. Banerjee, "Strategies for Reconfiguring Hypercubes Under Faults," Proc. 20th Int'l Symp. Fault Tolerant Computing, pp. 210-217, June 1990.
[2] 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.
[3] M.S. Chen and K.G. Shin, "Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 152-159, Apr. 1990.
[4] G.-M. Chiu and K.-S. Chen, "Fault-Tolerant Routing Strategy Using Routing Capability in Hypercube Multicomputers," Proc. Int'l Conf. Parallel and Distributed Systems, pp. 396-403, June 1996.
[5] G.M. Chiu and S.P. Wu, "A Fault-Tolerant Routing Strategy in Hypbercube Multicomputers," IEEE Trans. Computers, vol. 45, no. 2, pp. 143-156, Feb. 1996.
[6] J.M. Gordon and Q.F. Stout, “Hypercube Message Routing in the Presence of Faults,” Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 318-327, Jan. 1988.
[7] 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.
[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.
[9] M. Peercy and P. Banerjee, "Distributed Algorithms for Shortest-Path, Deadlock-Free Routing and Broadcasting in Arbitrarily Faulty Hypercubes," Proc. 20th Int'l Symp. Fault Tolerant Computing, pp. 218-225, June 1990.
[10] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[11] S.-B. Tien and C.S. Raghavendra,“Algorithms and bounds for shortest paths and diameter in faultyhypercubes,” IEEE Trans. Parallel and Distributed Systems, pp. 713-718, June 1993.
[12] J. Wu and K. Yao, "A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes," IEEE Trans. Computers, vol. 44, no. 9, pp. 1,162-1,167, Sept. 1995.

Index Terms:
Fault tolerance, hypercubes, routing, routing capability, shortest path.
Citation:
Ge-Ming Chiu, Kai-Shung Chen, "Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Transactions on Computers, vol. 46, no. 8, pp. 953-958, Aug. 1997, doi:10.1109/12.609283
Usage of this product signifies your acceptance of the Terms of Use.