# Optimum simulation of meshes by small hypercubes

## Abstract

We consider optimum simulations of large mesh networks by hypercubes. For any arbitrary mesh M, let "M's optimum hypercube" be the smallest hypercube that has at least as many processors as M and, for any k>0, let Q(M/2^{k}) be "M's 1/2^{k}-size hypercube", which has 1/2^{k} as many processors as M's optimum hypercube. The ratio MI/Q(M/2^{k}) is called *M's* 1/2^{ k }- *density*. We show that (a) for every 2-D mesh M, if M's 1/2-density≤1.828, then M can be embedded into its 1/2-size hypercube with dilation 1 and load factor 2, (b) for every 2-D mesh M, if M's 1/4-density≤3.809, then M can be embedded into its 1/4-size hypercube with dilation 1 and load factor 4, and if M's 1/4-density≤2.8125, then M can be embedded into its 1/4-size hypercube with dilation 1 and load factor 3, (c) If every 2-D mesh M with 1/2^{k}_{1}-density≤a can be embedded into its 1/2^{k}_{1}-size hypercube with dilation 1 and load factor l_{1}, and every 2-D mesh M with 1/2^{k}_{2}-density ≤b can be embedded into its 1/2^{k}_{2}-size hypercube with dilation 1 and load factor l_{2}, then we can obtain the densities for load factor l_{1}+l_{2} and load factor l_{1}×l_{2} based on a, b.

## Keywords

Load Factor Cycle Length Product Theorem Optimum Embedding Arbitrary Mesh## Preview

Unable to display preview. Download preview PDF.

## References

- [BMS]S. Bettayeb, Z. Miller, and I.H. Sudborough, "Embedding Grids into Hypercubes",
*Proc. ′88 AWOC: VLSI, Algorithms and Architectures Conf.*(July, 1988), Spring Verlag's Lecture Notes in Computer Science, vol. 327.Google Scholar - [BCLR]S. Bhatt, F. Chung, F. T. Leighton, and A. Rosenberg, "Optimal Simulations of Tree Machines",
*Proc. of 27th Annual IEEE Foundations of Computer Sci. Conf.*(1986), pp.274–282.Google Scholar - [BCHLR]S. Bhatt, F. Chung, J-W. Hong, F. T. Leighton, and A. Rosenberg, "Optimal Simulations by Butterfly Networks",
*Proc. of 23rd Annual ACM Theory of Computer Sci. Conf.*(1988), pp 192–204.Google Scholar - [C1]M-Y. Chan, "Dilation 2 Embeddings of Grids into Hypercubes",
*Proc. Int. Conf. on Parallel Processing*, August, 1988.Google Scholar - [C2]M-Y. Chan, "Embedding of 3-D Grids into optimal Hypercube", Technical Report (January, 1989), Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083-0688.Google Scholar
- [C3]M-Y. Chan, "Embedding of d-D Grids into optimal Hypercubes", Technical Report (January, 1989), Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083-0688.Google Scholar
- [DS1]A. Dingle and I.H. Sudborough, "Efficient Uses of Pyramid Networks", Technical Report (January, 1989), Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083-0688.Google Scholar
- [DS2]A. Dingle and I.H. Sudborough, "Simulations of Binary Trees and X-trees by Pyramids", Technical Report (January, 1989), Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083-0688Google Scholar
- [FS]A. Fiat and A. Shamir, "Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers",
*Proc. of 1984 IEEE Foundations of Computer Sci. Conf.*, pp. 37–45.Google Scholar - [GH]A. K. Gupta and S. E. Hambrusch, "Embedding Large Tree Machines into Small Ones",
*Proc. of the 5th MIT Conf. on Advanced Research in VLSI*, March, 1988, pp. 179–199.Google Scholar - [HJ]C. T. Ho and S. L. Johnsson. "On the Embedding of Arbitrary Meshes in Boolean Cubes with Expansion Two and Dilation Two",
*Proc. 1987 Int. Conf. on Parallel Processing*(August, 1987), pp. 188–191.Google Scholar - [L]J. Lee, "Embedding d-D Meshes into Optimum Size Hypecubes with dilation 4d-1", Technical Report (February, 1989), Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083-0688Google Scholar
- [MS]Z. Miller and I. H. Sudborough, "Compressing Meshes into Small Hypercubes", to appear.Google Scholar