Embedding 3-dimensional Grids into Optimal Hypercubes

The hypercube is a particularly versatile network for parallel computing. It is well-known that 2-dimensional grid machines can be simulated on a hypercube with a small constant communication overhead. We introduce new easily computable functions which embed many 3-dimensional grids into their optimal hypercubes with dilation 2. Moreover, we show that one can reduce the open problem to recognize whether it is possible to embed every 3-dimensional grid into its optimal hypercube with dilation at most 2 by constructing embeddings for a particular class of grids. We embed some of these grids, and thus for the first time one can guarantee that every 3-dimensional grid with at most 29–18 nodes is embeddable into its optimal hypercube with dilation 2.

[1]  M. Y. Chan,et al.  Embedding of d-dimensional grids into optimal hypercubes , 1989, SPAA '89.

[2]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[3]  Burkhard Monien,et al.  Embedding one interconnection network in another , 1990 .

[4]  Francis Y. L. Chin,et al.  Dilation-5 embedding of 3-dimensional grids into hypercubes , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[5]  S. Johnsson,et al.  Embedding Meshes in Boolean Cubes by Graph Decomposition , 1990 .

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

[7]  Zevi Miller,et al.  Embedding Grids into Hypercubes , 1992, J. Comput. Syst. Sci..

[8]  Zevi Miller,et al.  Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract) , 1994, Canada-France Conference on Parallel and Distributed Computing.

[9]  Zevi Miller,et al.  Embedding Grids into Hypercubes , 1988, AWOC.

[10]  D. Scott,et al.  Minimal mesh embeddings in binary hypercubes , 1988, IEEE Trans. Computers.