This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes
January 1999 (vol. 48 no. 1)
pp. 81-88

Abstract—To embed a ring in a hypercube is to find a Hamiltonian cycle through every node of the hypercube. It is obvious that no 2n-node Hamiltonian cycle exists in an n-dimensional faulty hypercube which has at least one faulty node. However, if a hypercube has faulty links only and the number of faulty links is at most n− 2, at least one 2n-node Hamiltonian cycle can be found. In this paper, we propose a distributed ring-embedding algorithm that can find a Hamiltonian cycle in a fault-free or faulty n-dimensional hypercube (Qn), and the complexity is O(n) parallel steps. The algorithm is based on the recursion property of the hypercube and the free-link dimension concept. In some cases, even when the number of faulty links is larger than n− 2, Hamiltonian cycles may still exist. We will show that the largest possible number of faulty links that can be tolerated is 2n−1− 1. The performance and the constraints of the fault-tolerant algorithm is also analyzed in detail in this paper. Furthermore, a dynamic reconfiguration algorithm for an embedded ring is proposed and discussed. Due to the distributed nature of the algorithms, they are useful for the simulation of ring-based multiprocessors on MIMD hypercube multiprocessors.

[1] M.Y. Chan and S.-J. Lee, "Distributed Fault-Tolerant Embeddings of Rings in Hypercubes," J. Parallel and Distributed Computing, vol. 11, pp. 63-71, 1991.
[2] F.J. Provost and R. Melhem, "Distributed Fault-Tolerant Embedding of Binary Trees and Rings in Hypercubes," Proc. Int'l Workshop Defect and Fault Tolerance in VLSI Systems, 1988.
[3] S. Latifi, S. Zheng, and N. Bagherzadeh, "Optimal Ring Embedding in Hypercubes with Faulty Links," Proc. Fault-Tolerant Computing Symp., pp. 178-184, 1992.
[4] M.S. Chen and K.G. Shin, "On Hypercube Fault-Tolerant Routing Using Global Information," Proc. Conf. Hypercubes, Concurrent Computers, and Applications, pp. 83-86, 1989.
[5] P.J. Yang, S.B. Tien, and C.S. Raghavendra, “Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions,” IEEE Trans. Computers, vol. 43, no. 5, pp. 608-613, May 1994.
[6] P.J. Yang, S.B. Tien, and C.S. Raghavendra, "Embedding of Multidimensional Meshes onto Faulty Hypercubes," Proc. Int'l Conf. Parallel Processing, pp. I571-I574, Aug. 1991.
[7] C.S. Raghavendra,P.-J. Yang,, and S.-B. Tien,“Free dimensions—an effective approach to achieving fault tolerance in hypercubes,” 22nd Ann. Int’l Symp. Fault-Tolerant Computing, pp. 170-177, 1992.
[8] M. S. Chen and K. G. Shin,“Processor allocation in an$N$-cube multiprocessor using gray codes,”IEEE Trans. Comput., vol. C-37, pp. 1396–1407, Dec. 1987.
[9] F. Harary, "A Survey of Hypercube Graphs," Computer Math. Applications, 1989.
[10] S. Park and B. Bose, "Broadcasting in Hypercubes with Link/Node Failures," Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 286-290, 1992.
[11] G. Fox et al., "Long Range Interactions," Solving Problems on Concurrent Processors, vol. 1, chapter 9, pp. 155-165. Prentice Hall, 1988.
[12] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[13] T.C. Lee, "Quick Recovery of Embedded Structures in Hypercube Computers," Proc. Fifth Memory Computing Conf., pp. 1,426-1,435, Apr. 1990.
[14] E.M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms. Prentice Hall, 1977.

Index Terms:
Hamiltonian cycle, faulty link, hypercube, free-link dimension, reconfiguration.
Citation:
Yuh-Rong Leu, Sy-Yen Kuo, "Distributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes," IEEE Transactions on Computers, vol. 48, no. 1, pp. 81-88, Jan. 1999, doi:10.1109/12.743414
Usage of this product signifies your acceptance of the Terms of Use.