Advertisement

A case for the PRAM as a standard programmer's model

  • Uzi Vishkin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 678)

Abstract

The paper advocates that the PRAM model of parallel computation will be a standard (but not exclusive) programmer's model for computers whose hardware features various kinds of parallelism.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Akl-89]
    S.G. Akl. The Design and Analysis of Parallel Algorithms. Prentice Hall, Engelwood Cliffs, New Jersey, 1989.Google Scholar
  2. [ALM-90]
    S. Arora, T. Leighton and B. Maggs. On-line algorithms for path selection in a nonblocking network. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 149–158, 1990.Google Scholar
  3. [EG-88]
    D. Eppstein and Z. Galil. Parallel algorithmic techniques for combinatorial computation. Ann. Rev. Comput. Sci., 3:233–283, 1988.Google Scholar
  4. [GR-88]
    A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, Cambridge, 1988.Google Scholar
  5. [HP-90]
    J.L. Hennessy and D.A. Patterson. Computer Architecture a Quantitative Approach. Morgan Kaufmann, San Mateo, California, 1990.Google Scholar
  6. [KR-90]
    R.M. Karp and V. Ramachandran. A survey of parallel algorithms for sharedmemory machines. In Handbook of Theoretical Computer Science: Volume A, Algorithms and Complexity (Editor J. van Leeuwen), MIT Press/Elsevier, 1990, pages 869–942.Google Scholar
  7. [KRS-90]
    C.P. Kruskal, L. Rudelph, and M. Snir. A complexity theory of efficient parallel algorithms. In Theoretical Computer Science, 71:95–132, 1990.Google Scholar
  8. [J-92]
    J. JáJá. Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.Google Scholar
  9. [KU-86]
    A. Karlin and E. Upfal. Parallel hashing — an efficient implementation of shared memory. In Proc. of the 18th Ann. ACM Symp. on Theory of Computing, pages 160–168, 1986.Google Scholar
  10. [L-92a]
    F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, California, 1992.Google Scholar
  11. [L-92b]
    F.T. Leighton. Methods for message routing in parallel machines. In Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pages 77–96, 1992.Google Scholar
  12. [MR-90]
    M. Metcalf and J. Reid. Fortran 90 Explained. Oxford University Press, New York, 1990.Google Scholar
  13. [MV-84]
    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.Google Scholar
  14. [R-87]
    A.G. Ranade. How to emulate shared memory. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 185–194, 1987.Google Scholar
  15. [R-92]
    J.H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann, San Mateo, California, 1992.Google Scholar
  16. [U-89]
    E. Upfal. An O(log N) deterministic packet routing scheme. In Proc. of the 21st Ann. ACM Symp. on Theory of Computing, pages 241–250, 1989.Google Scholar
  17. [Va90a]
    L.G. Valiant. A bridging model for parallel computation. Comm. ACM, 33,8:103–111, 1990.Google Scholar
  18. [Va90b]
    L.G. Valiant. General purpose parallel architectures. In Handbook of Theoretical Computer Science: Volume A, Algorithms and Complexity (Editor J. van Leeuwen), MIT Press/Elsevier, 1990, pages 942–971.Google Scholar
  19. [Vi-83]
    U. Vishkin. Synchronous parallel computation — a survey. Technical Report TR 71, Dept. of Computer Science, Courant Institute, New York University, 1983.Google Scholar
  20. [Vi-84]
    U. Vishkin. A parallel-design distributed-implementation (PDDI) general purpose computer. Theoretical Computer Science, 32:157–172, 1984.Google Scholar
  21. [Vi-91a]
    U. Vishkin. Structural parallel algorithmics. In Proc. of the 18th Int. Colloquium on Automata, Languages and Programming, pages 363–380, 1991, Lecture Notes in Computer Science 510, Springer-Verlag.Google Scholar
  22. [Vi-91b]
    U. Vishkin. Can parallel algorithms enhance serial implementation? TR-91-145, University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, Maryland 20742–3251, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Uzi Vishkin
    • 1
    • 2
  1. 1.University of MarylandUSA
  2. 2.Tel Aviv UniversityIsrael

Personalised recommendations