Skip to main content
SpringerLink
Log in

Shared memory simulations with triple-logarithmic delay

Extended abstract

  • Session 1. Chair: Gianfranco Bilardi
  • Conference paper
  • First Online:
Book cover Algorithms — ESA '95 (ESA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 979))

Included in the following conference series:

Abstract

We consider the problem of simulating a PRAM on a distributed memory machine (DMM). Our main result is a randomized algorithm that simulates each step of an n-processor CRCW PRAM on an n-processor DMM with \(\mathcal{O}\)log log log n log* n) delay, with high probability. This is an exponential improvement on all previously known simulations. It can be extended to a simulation of an (n log log log n log* n)-processor EREW PRAM on an n-processor DMM with optimal delay \(\mathcal{O}\)(log log log n log* n), with high probability. Finally a lower bound of Ω(log log log n/log log log log n) expected time is proved for a large class of randomized simulations that includes all known simulations.

Supported in part by DFG-Graduiertenkolleg “Parallele Rechnernetzwerke in der Produktionstechnik”, ME 872/4-1, by DFG-Sonderforschungsbereich 1511 “Massive Parallelität: Algorithmen, Entwurfsmethoden, Anwendungen”, by DFG Leibniz Grant Me872/6-1, and by the Esprit Basic Research Action Nr 7141 (ALCOM II)

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Bast and T. Hagerup. Fast parallel space allocation, estimation and integer sorting (revised). Technical Report MPI-I-93-123, Max-Planck-Institut für Informatik, Im Stadtwald 66123 Saarbrücken, June 1993. A preliminary version appeared in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing under the title “Constant-Time Parallel Integer Sorting”, 1991.

    Google Scholar 

  2. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM Journal on Computing, 22(2):221–242, 1993. A preliminary version appeared in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 196–202, 1989.

    Google Scholar 

  3. A. Czumaj, F. Meyer auf der Heide, and V. Stemann. Improved optimal shared memory simulations, and the power of reconfiguration. To appear in Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems, 1995.

    Google Scholar 

  4. M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Proceedings of the 17th Annual International Colloquium on Automata, Languages and Programming, pages 6–19, 1990.

    Google Scholar 

  5. M. Dietzfelbinger and F. Meyer auf der Heide. Simple, efficient shared memory simulations. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 110–119, 1993.

    Google Scholar 

  6. L. A. Goldberg, Y. Matias, and S. Rao. An optical simulation of shared memory. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 257–267, 1994.

    Google Scholar 

  7. J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 698–710, 1991.

    Google Scholar 

  8. M. T. Goodrich, Y. Matias, and U. Vishkin. Optimal parallel approximation algorithms for prefix sums and integer sorting. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 241–250, 1994.

    Google Scholar 

  9. J. JáJá. An Introduction to Parallel Algorithms. Addison Wesley, 1992.

    Google Scholar 

  10. R. M. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. Technical Report tr-ri-93-134, University of Paderborn, 1993, to appear in Algorithmica. A preliminary version appeared in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 318–326, 1992.

    Google Scholar 

  11. A. Karlin and E. Upfal. Parallel hashing — an efficient implementation of shared memory. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 160–168, 1986.

    Google Scholar 

  12. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, 1992.

    Google Scholar 

  13. F. T. Leighton. Methods for packet routing in parallel machines. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 77–96, 1992.

    Google Scholar 

  14. F. Meyer auf der Heide. Hashing strategies for simulating shared memory on distributed memory machines. In Proceedings of the Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use, pages 20–29, 1992.

    Google Scholar 

  15. P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman. On contention resolution protocols and associated probabilistic phenomena. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 153–162, 1994.

    Google Scholar 

  16. F. Meyer auf der Heide, C. Scheideler, and V. Stemann. Exploiting storage redundancy to speed up randomized shared memory simulations. To appear in Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, 1995.

    Google Scholar 

  17. P. Ragde. The parallel simplicity of compaction and chaining. Journal of Algorithms, 14:371–380, 1993.

    Google Scholar 

  18. A. G. Ranade. How to simulate shared memory. Journal of Computer and System Sciences, 42:307–326, 1991.

    Google Scholar 

  19. A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 20–25, 1989.

    Google Scholar 

  20. E. Upfal. Efficient schemes for parallel communication. Journal of the ACM, 31:507–517, 1984.

    Article  Google Scholar 

  21. E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34:116–127, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Heinz Nixdorf Institute, University of Paderborn, D-33095, Paderborn, Germany

    Artur Czumaj & Volker Stemann

  2. Department of Computer Science, University of Paderborn, D-33095, Paderborn, Germany

    Friedhelm Meyer auf der Heide

Authors
  1. Artur Czumaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedhelm Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Volker Stemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czumaj, A., Meyer auf der Heide, F., Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133

Download citation

  • DOI: https://doi.org/10.1007/3-540-60313-1_133

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60313-9

  • Online ISBN: 978-3-540-44913-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation