Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes

We consider the problem of embedding and reconfiguring binary tree structures in faulty hypercubes. We assume that the number of faulty nodes is at most (n-2), where n is the number of dimensions of the hypercube; we further assume that the location of faulty nodes are known. Our 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 in faulty hypercubes. We extend the free dimension concept to degree of occupancy and use this to develop a distributed scheme for reconfiguration of binary tree in faulty hypercubes with up to [3n/2] node faults.

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

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

[3]  Fikret Erçal,et al.  Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..

[4]  Cauligi S. Raghavendra,et al.  Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions , 1994, IEEE Trans. Computers.

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

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

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

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

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

[10]  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.

[11]  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.

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

[13]  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.

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

[15]  S. F. Nugent,et al.  The iPSC/2 direct-connect communications technology , 1988, C3P.

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

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

[18]  Cauligi S. Raghavendra,et al.  Embedding and reconfiguration of binary trees in faulty hypercubes , 1992, Proceedings Sixth International Parallel Processing Symposium.

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

[20]  Jehoshua Bruck,et al.  Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hybercubes , 1993, FTCS.

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

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

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

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