Optimal Simulation of Full Binary Trees on Faulty Hypercubes

We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embedding strategy, we present two results for embedding an (n-1) tree fa full binary tree with 2/sup n-1/ nodes) into an n-cube (a hypercube with 2/sup n/ nodes) with unit dilation and load. For the problem where the root of the tree must be mapped to a specified hypercube node (specified root embedding problem), we show that up to n-2 (node or edge) faults can be tolerated. This result is optimal in the following sense: 1) it is time-optimal, 2) (n-1)-tree is the largest fall binary tree that can be embedded in an n-cube, and 3) n-2 faults Is the maximum number of worst-case faults that can be tolerated in the specified root problem. Furthermore, we also show that any algorithm for this problem cannot be totally recursive in nature. For the problem where the root can be mapped to any nonfaulty hypercube node (variable root embedding problem), we show that up to 2n-3-[log n] faults can be tolerated. Thus we have improved upon the previous result of n-1-[log n]. In addition, we show that the algorithm for the variable root embedding problem is optimal within a class of algorithms called recursive embedding algorithms as far as the number of tolerable faults is concerned. Finally, we show that when an O(1spl radic/n) fraction of nodes in the hypercube are faulty, it is not always possible to have an O(1)-load variable root embedding no matter how large the dilation is. >

[1]  Ernst W. Mayr,et al.  Embedding complete binary trees in faulty hypercubes , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[2]  Ivan Hal Sudborough,et al.  Simulating Binary Trees on Hypercubes , 1988, AWOC.

[3]  Francis Y. L. Chin,et al.  A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..

[4]  Frank Thomson Leighton,et al.  Fast Computation Using Faulty Hypercubes (Extended Abstract) , 1989, Symposium on the Theory of Computing.

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

[6]  Francis Y. L. Chin,et al.  On Embedding Rectangular Grids in Hypercubes , 1988, IEEE Trans. Computers.

[7]  Arnold L. Rosenberg,et al.  Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

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

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

[11]  Alan Wagner,et al.  Embedding Trees in a Hypercube is NP-Complete , 1990, SIAM J. Comput..

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

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

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

[15]  Frank Thomson Leighton,et al.  Dynamic tree embeddings in butterflies and hypercubes , 1989, SPAA '89.

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

[17]  Alan S. Wagner.  Embedding Arbitrary Binary Trees in a Hypercube , 1989, J. Parallel Distributed Comput..

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

[19]  Frank Harary,et al.  Subcube Fault-Tolerance in Hypercubes , 1993, Inf. Comput..

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

[21]  Mee Yee Chan.  Embedding of Grids into Optimal Hypercubes , 1991, SIAM J. Comput..