A distributed scheme for many-to-one embedding binary trees into hypercubes

The commercial hypercube-based machine is a good physical architecture for embedding various logical topologies because of its logarithmic diameter and high bandwidth. Through such embedding, the algorithms originally developed for logical topologies can be directly executed on hypercubes. We present a distributed scheme for embedding larger binary trees into smaller hypercubes. From a practical point of view, this is a very important issue when a hypercube of limited size is available. The desired embeddings can be constructed in parallel with time complexity of O (log N), where N is the total number of tree nodes. It provides a uniform many-to-one embedding with minimum overhead.<
>