A practical model of parallel computation

Communications of the ACM

Volumn 39, Issue 11, 1996, Pages 78-85

  Culler, David E ^a   Karp, Richard M ^b,c   Patterson, David ^a   Sahay, Abhijit ^d   Santos, Eunice E ^e   Schauser, Klaus Erik ^f   Subramonian, Ramesh ^g   Von Eicken, Thorsten ^h  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Washington   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

^d Iris Fin Eng and Systems Inc

^e Lehigh University

^f University of California   (United States)

^g Lockheed Corp

^h NONE

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER AIDED ANALYSIS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; FAST FOURIER TRANSFORMS; NETWORK PROTOCOLS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; STORAGE ALLOCATION (COMPUTER);

BULK SYNCHRONOUS PARALLEL (BSP) MODEL; MASSIVELY PARALLEL PROCESSORS (MPP); PARALLEL RANDOM ACCESS MACHINE (PRAM);

PARALLEL PROCESSING SYSTEMS;

EID: 0030287932     PISSN: 00010782     EISSN: None     Source Type: Journal    
DOI: 10.1145/240455.240477     Document Type: Article

References (19)

1. Aggarwal, A., Chandra, A. K., and Snir, M. Communication complexity of PRAMs. In Theoretical Computer Science (March 1990).
2. Alexander, A., Ionescu, M., Schauser, K., and Scheiman, C. LogP: Incorporating long messages into the LogP model. In The 7th Annual Symposium on Parallel Algorithms and Architectures. July 1995.
3. Alpern, B., Carter, L., Feig, E., and Selker, T. The uniform memory hierarchy model of computation. Algorithmic (1993).
4. Blelloch, G. E., Leiserson, C. E., Maggs, B. M., Plaxton, C. G., Smith, S. J., and Zagha, M. A comparison of sorting algorithms for the connection machine CM-2. In Proceedings of the Symposium on Parallel Architectures and Algorithms. 1990.
5. Culler, D., Liu, L. T., Martin, R., and Yoshikawa, C. Assessing fast network interfaces. IEEE Micro 16, 1 (Feb. 1996).
6. Culler, D. E., Karp, R. M., Patterson, D. A., Sahay, A., Schauser, K. E., Santos, E., Subramonian, R., and von Eicken, T. LogP: Towards a realistic model of parallel computation In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. May 1993.
7. Dusseau, A., Culler, D., Schauser, K., and Martin, R. Fast parallel sorting under LogP: Experiences with CM-5. IEEE Trans. Parallel and Distrib. Syst. 7, 8. (1996).
8. Fortune, S., and Wyllie, J. Parallelism in random access machines. In Proceedings of the 10th Annual Symposium on Theory of Computing. 1978.
9. Gibbons, P. B. A more practical PRAM model. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures. ACM, 1989.
10. Heywood, T. and Ranka, S. A practical hierarchical model of parallel computation. J. Parallel and Distrib. Comput. 16, 3 (Nov. 1992).
11. Karp, R. M., Luby, M. and Meyer auf der Heide, F. Efficient PRAM simulation on a distributed memory machine. In Proceedings of the 24th Annual ACM Symposium of the Theory of Computing (May 1992).
12. Karp, R. M., Sahay, A., Santos, E. and Schauser, K. E. Optimal broadcast and summation in the LogP model. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures. ACM, 1993.
13. Leighton, F. T. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan Kaufmann, New York, 1992.
14. Mehlhorn, K. and Vishkin, U. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica 21. (1984).
15. Papadimitriou, C. H. and Yannakakis, M. Towards an architecture-independent analysis of parallel algorithms. In Proceedings of the 20th Annual ACM Symposium of the Theory of Computing. ACM, 1988.
16. Ranade, A. G. How to emulate shared memory. In Proceedings of the 28th IEEE Annual Symposium on Foundations of Computer Science. 1987.
17. Santos, E. E. Solving triangular linear systems in parallel using substitution. In Proceedings of the 7th Annual IEEE Symposium on Parallel and Distributed Processing. 1995.
18. Snyder, L. Type architectures, shared memory, and the corollary of modest potential. In Ann. Rev. Comput. Sci. Annual Reviews Inc., 1986, pp 289-317.
19. Valiant, L. G. A bridging model for parallel computation. Commun. ACM 33, 8 (Aug. 1990).