Embedding all binary trees in the hypercube

An O(N/sup 2/) heuristic algorithm is presented that embeds all binary trees, with dilation 2 and small average dilation, into the optimal sized hypercube. The heuristic relies on a conjecture about all binary trees with a perfect matching. It provides a practical and robust technique for mapping binary trees into the hypercube and ensures that the communication load is evenly distributed across the network assuming any shortest path routing strategy. One contribution of this work is the identification of a rich collection of binary trees that can be easily mapped into the hypercube.<<ETX>>

[1]  I. Havel,et al.  $B$-valuations of graphs , 1972 .

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

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

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

[5]  Ivan Havel,et al.  One-legged caterpillars span hypercubes , 1986, J. Graph Theory.

[6]  George Papageorgiou,et al.  The Complexity of Cubical Graphs , 1985, Inf. Control..

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

[8]  Garth Peter Smedley.  Algorithms for embedding binary trees into hypercubes , 1989 .

[9]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[10]  L. Nebeský.  On cubes and dichotomic trees , 1974 .