Embedding and reconfiguration of binary trees in faulty hypercubes

Considers the problem of embedding and reconfiguring binary tree structures in faulty hypercubes. The authors assume that the number of faulty nodes is about n, where n is the number of dimensions of the hypercube; they further assume that the location of faulty nodes are known. The embedding techniques are based on a key concept called free dimension, which can be used to partition a cube into subcubes such that each subcube contains at most one faulty node. Using this approach, two distributed schemes are provided for embedding and reconfiguration of binary trees in faulty hypercubes.<<ETX>>

[1]  Cauligi S. Raghavendra,et al.  Free dimensions-an effective approach to achieving fault tolerance in hypercube , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[2]  Rami Melhem,et al.  Distributed Fault Tolerant Embedding of Binary Trees and Rings in Hypercubes , 1989 .

[3]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[4]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[5]  Prithviraj Banerjee.  Strategies for reconfiguring hypercubes under faults , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[6]  John P. Hayes,et al.  An automorphic approach to the design of fault-tolerant multiprocessors , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

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

[8]  Wei-Tek Tsai,et al.  An efficient multi-dimensional grids reconfiguration algorithm on hypercube , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[9]  Parameswaran Ramanathan,et al.  Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.

[10]  Ilse C. F. Ipsen,et al.  How to Embed Trees in Hypercubes. , 1985 .

[11]  Tze Chiang Lee.  Quick Recovery of Embedded Structures in Hypercube Computers , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[12]  Cauligi S. Raghavendra,et al.  Reconfiguring embedded task graphs in faulty hypercubes by automorphisms , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.

[13]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[14]  Cauligi S. Raghavendra,et al.  Broadcasting algorithms in faulty SIMD hypercubes , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[15]  Jehoshua Bruck,et al.  Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[16]  Cauligi S. Raghavendra,et al.  Embedding of Multidimensional Meshes on to Faulty Hypercubes , 1991, ICPP.

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

[18]  Roy M. Jenevein,et al.  Scaleability of a Binary Tree on a Hypercube , 1986, ICPP.

[19]  Frank Thomson Leighton,et al.  Reconfiguring a hypercube in the presence of faults , 1987, STOC.

[20]  Angela Y. Wu,et al.  Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..