Skip to main content
Log in

The Shuffled Mesh: a flexible and efficient model for parallel computing

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this work an efficient model for parallel computing, called Shuffled Mesh (SM), is introduced. This bounded degree model has the mesh as subgraph and it is based on the union of mesh and shuffle‐exchange topologies. It is shown that an N‐processor SM combines the features of mesh, shuffle‐exchange, hypercubic networks, mesh of trees and hypercube, and is able to support all the algorithms designed for such topologies with constant or logarithmic time performance degradation. Finally, it is proved that the VLSI layout of a SM is the same as of a shuffle exchange of the same size.

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. S.N. Bhatt, F.R.K. Chung, J.-W. Hong, F.T. Leighton and A.L. Rosemberg, Optimal simulations by butterfly networks, in: Proc. of the 20th Annual ACM Symposium on the Theory of Computing (1988) pp. 192–204.

  2. M. Chan, Dilation 2-embeddings of grids into hypercubes, in: Proc. of the 1988 Internat. Conf. on Parallel Processings (1988) pp. 295–298.

  3. K.-L. Chung and F.-C. Lin, A cost-optimal parallel algorithm for B-spline surface fitting, Computer Vission, Graphics, and Image Processing 53 (1991) 601–605.

    Google Scholar 

  4. K. Efe, Embedding mesh of trees in the hypercube, Journal of Parallel and Distributed Computing 11 (1991) 222–230.

    Article  Google Scholar 

  5. D. Kleitman, F.T. Leighton, M. Lepley and G.L. Miller, New layouts for shuffle-exchange graph, in: Proc. of the 13th Annual ACM Symposium on the Theory of Computing (1981) pp. 278–292.

  6. R. Koch, T. Leighton, B. Maggs, S. Rao and A. Rosenberg, Work-preserving emulations of fixed-connection networks, in: Proc. of the 21th Annual ACM Symposium on the Theory of Computing (1989) pp. 227–240.

  7. T. Leighton, New lower bound techniques for VLSI, in: Proc. of the 22th Annual IEEE Symposium on Foundations of Computer Science (1981) pp. 1–12.

  8. T. Leighton, B. Maggs and S. Rao, Universal packet routing algorithms, in: Proc. of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) pp. 256–271.

  9. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufmann, San Mateo, CA, 1992).

    Google Scholar 

  10. F.P. Preparata and J.E. Vuillemin, The cube-connected cycles: A versatile network for parallel computation, in: Proc. of the 12th Annual IEEE Symposium on Foundations of Computer Science (1979) pp. 140–147.

  11. H.S. Stone, Parallel processing with the perfect shuffle, IEEE Transactions on Computers 20 (1971) 153–161.

    Google Scholar 

  12. C.D. Thompson, A complexity theory for VLSI, Ph.D. thesis, Carnegie-Mellon University, Pittsburg, PA (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bongiovanni, G., De Biase, G., Massini, A. et al. The Shuffled Mesh: a flexible and efficient model for parallel computing. Telecommunication Systems 13, 21–27 (2000). https://doi.org/10.1023/A:1019119401309

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019119401309

Keywords

Navigation