Advertisement

Exploiting storage redundancy to speed up randomized shared memory simulations

Extended abstract
  • Friedhelm Meyer
  • Christian Scheideier
  • Volker Stemann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 900)

Abstract

This paper presents and analyses efficient implementations of a so-called direct process on distributed memory machines (DMMs) that yields
  • a simulation of an n-processor PRAM on an n-processor optical crossbar DMM with delay O(log log n),

  • a simulation of an n-processor PRAM on an n-processor arbitrary DMM with delay O(log log n/log log log n),

  • an implementation of a static dictionary on an n-processor arbitrary DMM with parallel access time of O(log*n).

We further prove a lower bound for executing the above process, showing that our implementations are optimal.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AM88]
    R.J. Anderson and G.L. Miller. Optical Communication for Pointer Based Algorithms, Technical Report CRI 88-14, Computer Science Department, University of Southern Carolina, Los Angeles, CA 90089-0782 USA, 1988.Google Scholar
  2. [BH91]
    H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. of the 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 50–61, 1991.Google Scholar
  3. [DM90]
    M. Dietzfelbinger, F. Meyer auf der Heide. How to distribute a hash table in a complete network. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pp. 117–127, 1990.Google Scholar
  4. [DM93]
    M. Dietzfelbinger and F. Meyer auf der Heide. Simple efficient shared memory simulations. In Proceedings of the 5th Ann. ACM Symposium on Parallel Algorithms and Architectures, pp. 110–119, 1993.Google Scholar
  5. [GT92]
    M. Geréb-Graus and T. Tsantilas. Efficient Optical Communication in Parallel Computers. In Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures, pp. 41–48, 1992.Google Scholar
  6. [GJL93]
    L. A. Goldberg and M. Jerrum and T. Leighton. A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer. In Proceedings of the 5th Ann. ACM Symposium on Parallel Algorithms and Architectures, pp. 300–309, 1993.Google Scholar
  7. [GMR94]
    L.A. Goldberg, Y. Matias, S. Rao. An optical simulation of shared memory. Technical Report, 1994.Google Scholar
  8. [GMV91]
    J. Gil, Y. Matias, U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. of the 32nd Ann. IEEE Symp. on Foundations of Computer Science, pp. 698–710, 1991.Google Scholar
  9. [KLM92]
    R. Karp, M. Luby and F. Meyer auf der Heide. Efficient PRAM simulation on distributed memory machine. In Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pp. 318–326, 1992.Google Scholar
  10. [M92]
    F. Meyer auf der Heide. Hashing strategies for simulating shared memory on distributed memory machines. In Proc. of the 1st Heinz Nixdorf Symposium “Parallel Architectures and Their Efficient Use”, F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., pp. 20–29, 1992.Google Scholar
  11. [MPR94]
    P.D. MacKenzie, C.G. Plaxton, R. Rajamaran. On contention resolution protocols and associated phenomena. University of Texas at Austin, Technical Report 94-06, 1994.Google Scholar
  12. [S89]
    A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In Proc. of the 30th IEEE Ann. Symp. on Foundations of Computer Science, pp. 20–25, 1989.Google Scholar
  13. [UW87]
    E. Upfal, A. Wigderson. How to share memory in a distributed system. J. Assoc. Comput. Mach. 34, pp. 116–127, 1987.Google Scholar
  14. [V75]
    L. Valiant. Parallelism in comparison problems. In SIAM J. Comp. 4(3), pp. 348–355, 1975.Google Scholar
  15. [V90]
    L. Valiant. General Purpose Parallel Architectures, Chapter 18 of Handbook of Theoretical Computer Science. Edited by J. van Leeuwen, Elsevier 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Friedhelm Meyer
    • 1
    • 2
  • Christian Scheideier
    • 2
  • Volker Stemann
    • 2
  1. 1.Heide
  2. 2.Department of Mathematics and Computer Science and Heinz Nixdorf InstituteUniversity of PaderbornPaderbornGermany

Personalised recommendations