Skip to main content
Log in

Mapping between 2-d meshes of the same size

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Given two 2-D meshesM 1 andM 2 of sizess i×ti wheres i≤ti (i=1,2) ands 1×t 1=s 2×t 2, embeddingM 1 toM 2 with minimum dilation is studied. First, several lower bounds on the dilations of embedding in different cases are presented. Then, an embedding algorithm with dilation [s 1/s 2]+2 for the cases 1s 2 is proposed, which almost matches the lower bound [s 1/s 2]. For the cases 1<s 2, another embedding algorithm is given with dilation min {ζ(s 1,h′)°, ζ(s 2,s 1)}, where ζ(s 1,h′)=min{ζ(s 1s 2,s 1), ζ(t 1,ϕ(2,s 1)))}

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akers S B, Harel D, Krishnamurthy B. The star graph: An attractive alternative to then-cube. InInt’l. Conf. Parallel Processing, 1987, pp. 393–400.

  2. Hong J W, Mehlhorn K, Rosenberg A L. Cost tradeoffs in graph embeddings.J. ACM, 1983, 30(4): 709–728.

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen C Y R, Chung Y C. Embedding networks with ring connections in hypercube machines. InInt’l. Conf. Parallel Processing, 1990, Vol. 3, pp. 327–334.

  4. Chan M Y, Chin F Y L. On embedding rectangular grids in hypercubes.IEEE Trans. Computers, 1988, C-37(10): 1285–1288.

    Article  MATH  MathSciNet  Google Scholar 

  5. Chan M Y. Dilation-2 embedding of grids into hypercubes. InInt’l Conf. Parallel Processing, 1988, Vol. 3, pp. 295–298.

  6. Demillo R A, Eisenstat S C, Lipton R J. Preserving average proximity in arrays.Commun. ACM, 1978, 21: 228–231.

    Article  MATH  MathSciNet  Google Scholar 

  7. Ho C T, Johnsson S L. Embedding three-dimensional meshes in Boolean cubes by graph decomposition. InInt’l Conf. Parallel Processing, 1990, 3: 319–326.

  8. Ho C T, Johnsson S L. On the embedding of arbitrary meshes in Boolean cubes with expansion two dilation two. InInt’l Conf. Parallel Processing, 1987, pp. 188–191.

  9. Liu H, Huang S S. Dilation-6 embedding of 3-dimensional grids into optimal hypercubes InInt’l Conf. Parallel Processing, 1991, Vol. 3, pp. 250–254.

  10. Nigram M, Sahni S, Krishanamurthy B. Embedding hamiltonians and hypercubes in star interconnection graphs. InInt’l Conf. Parallel Processing, 1990, Vol. 3, pp. 340–343.

  11. Saad Y, Schultz M H. Topological properties of hypercubes.IEEE Trans. Computers, 1988, C-37(7): 867–872.

    Article  Google Scholar 

  12. Aleliunas R, Rosenberg A L. On embedding rectangular grids in square grids.IEEE Trans. Computers, 1982, C-31(9): 907–913.

    Article  MATH  Google Scholar 

  13. Kosaraju S R, Atallah M J. Optimal simulations between mesh-connected arrays of processors.J ACM, 1988, 35: 635–650.

    Article  MathSciNet  Google Scholar 

  14. Leighton F T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan Kaufmann Publishers, Inc., 1992.

  15. Wu A Y. Embedding of tree networks into hypercubes.J. of Parallel and Distributed Computing, 1985, 2: 238–249.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Peng Guoqiang is a Lecturer in Huazhong University of Science and Technology. His research interests include distributed operating systems and parallel processing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peng, G. Mapping between 2-d meshes of the same size. J. of Comput. Sci. & Technol. 12, 470–475 (1997). https://doi.org/10.1007/BF02943178

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943178

Keywords

Navigation