Advertisement

Embedding 3-dimensional grids into optimal hypercubes

  • Markus Röttger
  • Ulf -Peter Schroeder
  • Walter Unger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 805)

Abstract

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.

Key words

embedding hypercubes 3-dimensional grids dilation GrayCode 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BMS]
    Bettayeb, S., Miller, Z., Sudborough, I.H.: Embedding Grids into Hypercubes, Proc. of Aegean Workshop on Computing, Springer Verlag's Lecture Notes in Computer Science, Vol. 319, 210–211, 1988.Google Scholar
  2. [Ch1]
    Chan, M.Y.: Dilation 2-embedding of grids into hypercubes, in Proc. International Conference on Parallel Processing, St. Charles, IL, 295–298, August 1988.Google Scholar
  3. [Ch2]
    Chan, M.Y.: Embedding of 3-dimensional grids into hypercubes, in Proc. Fourth Conference on Hypercubes, Concurrent Computers, and Applications, Monterey, CA, March 1989.Google Scholar
  4. [Ch3]
    Chan, M.Y.: Embedding of d-dimensional grids into optimal hypercubes, in Proc. 1989 ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, 52–57, June 1989.Google Scholar
  5. [Ch4]
    Chan, M.Y.: Embedding of grids into optimal hypercubes, SIAM J. Computing, Vol. 20, No 5, 834–864, October 1991.Google Scholar
  6. [HJ]
    Ho, C.T., Johnsson, S.L.: Embedding Meshes in Boolean Cubes by Graph Decomposition, Journal of Parallel an Distributed Computing 8, 325–339, 1990.Google Scholar
  7. [MS]
    Monien, B., Sudborough, I.H.: Embedding one Interconnection Network in Another, Springer Verlag, Computing Suppl. 7, 257–282, 1990.Google Scholar
  8. [SB]
    Scott, D.S., Brandenburg, J.: Minimal mesh embeddings in binary hypercubes, IEEE Transaction on computers, Vol. 37, No. 10, October 1988.Google Scholar
  9. [Sud]
    Sudborough, I.H.: Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1, University of Texas at Dallas, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Markus Röttger
    • 1
  • Ulf -Peter Schroeder
    • 1
  • Walter Unger
    • 1
  1. 1.Department of Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations