Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes

We consider the problem of embedding a cube-connected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a list of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of the faulty edges. The algorithm has optimal running time and tolerates the maximum number of faults (in a worst-case setting). Because ascend-descend algorithms can be implemented efficiently on a CCC, this embedding enables the implementation of ascend-descend algorithms, such as bitonic sort, on hypercubes with edge faults. We also present a number of related results, including an algorithm for embedding a CCC into a hypercube with edge and node faults and an algorithm for embedding a spanning torus into a hypercube with edge faults. >

[1]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  C. Thompson.  Area-time complexity for VLSI , 1979, STOC 1979.

[3]  Danny Dolev,et al.  A new look at fault tolerant network routing , 1984, STOC '84.

[4]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[5]  Bernd Becker,et al.  How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  M. Livingston,et al.  Embeddings in hypercubes , 1988 .

[7]  Jehoshua Bruck.  Harmonic analysis of neural networks , 1989, Twenty-Third Asilomar Conference on Signals, Systems and Computers, 1989..

[8]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[9]  Fred S. Annexstein.  Fault tolerance in hypercube-derivative networks , 1989, SPAA '89.

[10]  Frank Thomson Leighton,et al.  Fast computation using faulty hypercubes , 1989, STOC '89.

[11]  Jehoshua Bruck,et al.  Running algorithms efficiently on faulty hypercubes , 1990, SPAA '90.

[12]  S. Johnsson,et al.  Embedding Meshes in Boolean Cubes by Graph Decomposition , 1990 .

[13]  S. Lennart Johnsson,et al.  Embedding Meshes in Boolean Cubes by Graph Decomposition , 1990, J. Parallel Distributed Comput..

[14]  Mee Yee Chan,et al.  On the Existence of Hamiltonian Circuits in Faulty Hypercubes , 1991, SIAM J. Discret. Math..

[15]  Krzysztof Diks,et al.  Optimal broadcasting in faulty hypercubes , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.

[16]  Frank Thomson Leighton,et al.  Coding theory, hypercube embeddings, and fault tolerance , 1991, SPAA '91.

[17]  Mee Yee Chan,et al.  Fault-Tolerant Permutation Routing in Hypercubes , 1993, J. Parallel Distributed Comput..

[18]  Mee Yee Chan,et al.  Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..