Advertisement

Simulation of PRAM models on meshes

  • Ville Leppänen
  • Martti Penttonen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 817)

Abstract

We analyze the complexity of simulating a PRAM (parallel random access machine) on a mesh structured distributed memory machine. By utilizing suitable algorithms for randomized hashing, routing in a mesh, and sorting in a mesh, we prove that simulation of a PRAM on \(\sqrt N \times \sqrt N (or \sqrt[3]{N} \times \sqrt[3]{N} \times \sqrt[3]{N})\) mesh is possible with \(O(\sqrt N ) (resp. O(\sqrt[3]{N}))\) delay with high probability. With more sophisticated simulations further speed-ups are achieved; experiments show delays as low as \(\sqrt N + o(\sqrt N ) (resp. (\sqrt[3]{N}) + o(\sqrt[3]{N}))\) per N PRAM processors.

Keywords

Hash Function Shared Memory Memory Location Computer Science Department Parallel Random Access Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Abolhassan, J. Keller, and W.J. Paul. On the Cost-Effectiveness of PRAMs. In 3rd IEEE Symposium on Parallel and Distributed Computing, pp. 2–9, 1991.Google Scholar
  2. 2.
    R. Beigel and C.P. Kruskal. Processor Networks and Interconnection Networks without Long Wires (Extended Abstract). In Proc. SPAA'89, pp. 42–51, 1989.Google Scholar
  3. 3.
    M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. Dynamic Perfect Hashing: Upper and Lower Bounds. Report TR-RI-91-77, University of Paderborn, Computer Science Department, 1991.Google Scholar
  4. 4.
    R. Drefenstedt and D. Schmidt. On the Physical Design of Butterfly Networks for PRAMs. In Proc. Fourth Symposium on the Frontiers'92, pp. 202–209, 1992.Google Scholar
  5. 5.
    C. Engelmann and J. Keller. Simulation-Based Comparison of Hash Functions for Emulated Shared Memory. In Proc. PARLE'93, 1993.Google Scholar
  6. 6.
    A.R. Karlin and E. Upfal. Parallel Hashing — an Efficient Implementation of Shared Memory. In 18th ACM Symp. on Theory of Computing, pp. 160–168, 1986.Google Scholar
  7. 7.
    M. Kaufmann, S. Rajasekaran, and J.F. Sibeyn. Matching the Bisection Bound for Routing and Sorting on the Mesh. In Proc. SPAA'92, pp. 31–40, 1992.Google Scholar
  8. 8.
    C.P. Kruskal, L. Rudolph, and M. Snir. A Complexity Theory of Efficient Parallel Algorithms. Theoretical Computer Science, 71:95–132, 1990.CrossRefGoogle Scholar
  9. 9.
    M. Kunde. Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound. In Proc. 32th FOCS, pp. 141–150, 1991.Google Scholar
  10. 10.
    F. T. Leighton. Introduction to Parallel Algorithms and Architectures: ArraysTreesHypercubes. Morgan Kaufman, San Mateo, CA, 1992.Google Scholar
  11. 11.
    V. Leppänen. PRAM Computation on Mesh Structures. Report R-93-9, University of Turku, Computer Science Department, November 1993. Ph.Lic. thesis.Google Scholar
  12. 12.
    V. Leppänen and M. Penttonen. Simulation of PRAM Models on Meshes. Report R-93-4, University of Turku, Computer Science Department, August 1993.Google Scholar
  13. 13.
    V. Leppänen and M. Penttonen. Work-Optimal Simulation of PRAM Models on Meshes. Report R-94-1, University of Turku, Computer Science Department, 1994.Google Scholar
  14. 14.
    K. Mehlhorn and U. Vishkin. Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Informatica, 21:339–374, 1984.CrossRefGoogle Scholar
  15. 15.
    M. Palis, S. Rajasekaran, and D.S.L. Wei. Emulation of a PRAM on Leveled Networks. Report MS-CIS-91-06, University of Pennsylvania, 1991.Google Scholar
  16. 16.
    A.G. Ranade. How to Emulate Shared Memory. Journal of Computer and System Sciences, 42:307–326, 1991.Google Scholar
  17. 17.
    A.G. Ranade, S.N. Bhatt, and S.L. Johnsson. The Fluent Abstract Machine. In Proc. 5th MIT Conference on Advanced Research in VLSI, pp. 71–93, 1988.Google Scholar
  18. 18.
    H. Schröder, O. Sýkora, and I. Vrto. Optimal Embedding of a Toroidal Array in a Linear Array. In Foundations of Computation Theory, pp. 390–394, 1991.Google Scholar
  19. 19.
    Y. Shiloach and U. Vishkin. A log n Parallel Connectivity Algorithm. Journal of Algorithms, 3:57–63, 1982.CrossRefGoogle Scholar
  20. 20.
    A. Simvonis. Packet Routing Problems on Mesh Connected Machines and High Resolution Layouts. PhD thesis, The University of Texas at Dallas, 1991.Google Scholar
  21. 21.
    L.G. Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, 33(8):103–111, 1990.CrossRefGoogle Scholar
  22. 22.
    L.G. Valiant. General Purpose Parallel Architectures. In Algorithms and Complexity, Handbook of Theoretical Computer Science, volume A, pp. 934–971, 1990.Google Scholar
  23. 23.
    P.M.B. Vitányi. Locality, Communication, and Interconnect Length in Multicomputers. SIAM Journal on Computing, 17(4):659–672, August 1988.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Ville Leppänen
    • 1
  • Martti Penttonen
    • 2
  1. 1.Department of Computer ScienceUniversity of TurkuFinland
  2. 2.Department of Computer ScienceUniversity of JoensuuFinland

Personalised recommendations