This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes
September 1993 (vol. 42 no. 9)
pp. 1078-1088

Wormhole routing with the e-cube algorithm is an excellent solution for deadlock-free interprocess communication in healthy hypercubes. However, it does not work for injured hypercubes where some nodes and/or links are faulty. The authors propose a new deadlock-free routing scheme in an injured hypercube with the wormhole routing capability. All previously proposed schemes suggest the use of virtual channels to avoid the cycle of resource dependency. By contrast, the authors' scheme is based on the re-establishment of a routing path to the destination, but it does not always yield a shortest path between the source and destination. The proposed routing scheme uses either wormhole routing or staged routing, depending on the availability of one or more healthy (n-2)-cubes within an injured n-cube.

[1] J. P. Hayes, T. Mudge,et al., "Architecture of hypercube supercomputers," inProc. 1986 ICPP, Aug. 1986, pp. 653-660.
[2] J. Rattner, "Concurrent processing: A new direction in scientific computing," inAFIPS Conf. Proc., vol. 54, pp. 157-166, 1985.
[3] Y. Saad and M. H. Schultz, "Topological properties of hypercube,"IEEE Trans. Comput., vol. C-37, pp. 867-872, July 1988.
[4] W. Athas and C. L. Seitz, "Multicomputers: Message-passing concurrent computers,"IEEE Computer, pp. 9-23, Aug. 1988.
[5] H. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105-117.
[6] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[7] M. S. Chen and K. G. Shin, "Depth-first search approach for fault-tolerant routing in hypercube multicomputers,"IEEE Trans. Parallel Distributed Syst., vol. PDS-1, pp. 152-159, Apr. 1990.
[8] M. S. Chen and K. G. Shin, "Adaptive fault-tolerant routing in hypercube multicomputers,"IEEE Trans. Comput., vol. 39, pp. 1406-1416, Dec. 1990.
[9] T. C. Lee and J. P. Hayes, "Routing and broadcasting in faulty hypercube computers," inProc. 3rd Conf. Hypercube Concurrent Comput. and Appl., vol. I, Jan. 1988, pp. 346-354.
[10] J. M. Gordon and Q. F. Stout, "Hypercube message routine in the presence of faults," inProc. 3rd Conf. Hypercube Concurrent Comput. and Appl., Jan. 1988, pp. 318-327.
[11] M. Peercy and P. Banerjee, "Distributed algorithms for shortest-path deadlock-free routing and broadcasting in arbitrarily faulty hypercubes," inProc. FTCS-20, June 1990, pp. 218-225.
[12] D. H. Linder and J. C. Harden, "An adaptive fault-tolerant wormhole routing strategy fork-aryn-cube,"IEEE Trans. Comput., vol. C-40, pp. 2-12, Jan. 1991.
[13] G.-M. Chiu, S. Chalasani, and C. S. Raghavendra, "Flexible, fault-tolerant routing criteria for circuit-switched hypercubes," in11th Int. Conf. Distrib. Computing Syst., 1991.
[14] B. Becker and H. U. Simon, "How robust is the n-cube?," inProc. 27th Annual Symposium on Foundations Computer Sci., Oct. 1986, pp. 283-291.
[15] D. M. Blough and N. Bagherzadeh, "Near-optimal message routing and broadcasting in faulty hypercubes,"Int. J. Parallel Programming, 1990.
[16] K. Jim and C. R. Das, "On subcube dependability in a hypercube," inProc. ACM SIGMETRICS'91, 1991, pp. 111-119.

Index Terms:
fault-tolerant routing; injured hypercubes; e-cube algorithm; wormhole routing; deadlock-free; staged routing; average message distance; message latency; successful message delivery; concurrency control; fault tolerant computing; hypercube networks; network routing.
Citation:
J. Kim, K.G. Shin, "Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes," IEEE Transactions on Computers, vol. 42, no. 9, pp. 1078-1088, Sept. 1993, doi:10.1109/12.241597
Usage of this product signifies your acceptance of the Terms of Use.