Advertisement

Memory access in models of parallel computation: From folklore to synergy and beyond

  • Selim G. Akl
Session 4 Invited Presentation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 519)

Abstract

We investigate various aspects of the role played by memory in the parallel random access machine (PRAM) model. Three results are obtained, each exhibiting a different consequence of the power of concurrent memory access in the PRAM: (i) two folk theorems are revisited and found not to hold for a class of inherently parallel problems; (ii) for a wide family of computations, the amount of work done by a parallel solution is shown to be smaller than that done by the best possible sequential one; and (iii) a model of computation is introduced which is an extension of the strongest variant of the PRAM, yet it requires no more resources than its weakest variant.

Keywords

Memory Access Parallel Algorithm Shared Memory Memory Location Sequential Algorithm 
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. [Ajtai]
    Ajtai, M., Komlós, J., and Szemerédi, E., An O(n log n) sorting network, Proceedings of the 15th Annual Symposium on Theory of Computing, Boston, Massachusetts, May 1983, pp. 1–9.Google Scholar
  2. [Akl 1]
    Akl, S.G., The Design and Analysis of Parallel Algorithms, Prentice-Hall, Englewood Cliffs, New Jersey, 1989.Google Scholar
  3. [Akl 2]
    Akl, S.G., Parallel synergy: Can a parallel computer be more efficient than the sum of its parts?, Technical Report No. 90-285, Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada, September 1990.Google Scholar
  4. [Akl 3]
    Akl, S.G., Cosnard, M., and Ferreira, A.G., Data-movement-intensive problems: Two folk theorems in parallel computation revisited, Technical Report No. 90-18, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, Lyon, France, June 1990.Google Scholar
  5. [Akl 4]
    Akl, S.G., and Guenther, G.R., Broadcasting with selective reduction, Proceedings of the 11th IFIP Congress, San Francisco, California, August 1989, pp. 515–520.Google Scholar
  6. [Batcher]
    Batcher, K.E., Sorting networks and their applications, Proceedings of the AFIPS 1968 Spring Joint Computer Conference, Atlantic City, New Jersey, April 1968, pp. 307–314.Google Scholar
  7. [Brent]
    Brent, R.P., The parallel evaluation of general arithmetic expressions, Journal of the ACM, Vol. 21, No. 2, April 1974, pp. 201–206.Google Scholar
  8. [Fava Lindon]
    Fava Lindon, L., and Akl, S.G., An optimal implementation of broadcasting with selective reduction, Technical Report No. 91-298, Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada, March 1991.Google Scholar
  9. [Gibbons]
    Gibbons, A., and Rytter, W., Efficient Parallel Algorithms, Cambridge University Press, Cambridge, England, 1988.Google Scholar
  10. [Hopcroft]
    Hopcroft, J.E., and Ullman, J.D., Introduction to Automata, Languages, and Computation, Addison-Wesley, Reading, Massachusetts, 1979.Google Scholar
  11. [Karp]
    Karp, R.M., and Ramachandran, V., A survey of parallel algorithms for shared memory machines, in: Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1990, pp. 869–941.Google Scholar
  12. [Kuck]
    Kuck, D.J., The Structure of Computers and Computations, Vol. 1, John Wiley & Sons, New York, 1978.Google Scholar
  13. [Parberry]
    Parberry, I., Parallel Complexity Theory, John Wiley & Sons, New York, 1987.Google Scholar
  14. [Shannon]
    Shannon, C.E., Memory requirements in a telephone exchange, Bell Systems Technical Journal, Vol. 29, 1950, pp. 343–349.Google Scholar
  15. [Vishkin]
    Vishkin, U., A parallel-design distributed-implementation (PDDI) general-purpose computer, Theoretical Computer Science, Vol. 32, 1984, pp. 157–172.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Selim G. Akl
    • 1
  1. 1.Department of Computing and Information ScienceQueen's UniversityKingstonCanada

Personalised recommendations