LogP: Towards a Realistic Model of Parallel Computation

ACM SIGPLAN Notices

Volumn 28, Issue 7, 1993, Pages 1-12

  Culler, David ^a   Karp, Richard ^a   Patterson, David ^a   Sahay, Abhijit ^a   Schauser, Klaus Erik ^a   Santos, Eunice ^a   Subramonian, Ramesh ^a   von Eicken, Thorsten ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

complexity analysis; massively parallel processors; parallel algorithms; parallel models; PRAM

Indexed keywords

EID: 84976790986     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/173284.155333     Document Type: Article

References (31)

1. A. Aggarwal, A. K. Chandra, and M. Snir. On Communication Latency in PRAM Computation. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 11-21. ACM, June 1989.
2. A. Aggarwal, A. K. Chandra, and M. Snir. Communication Complexity of PRAMs. In Theoretical Computer Science, pages 3-28, March 1990.
3. B. Alpern, L. Carter, E. Feig, and T. Selker. The Uniform Memory Hierarchy Model of Computation. Algorithmica, 1993. (to appear).
4. A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the postal model for message-passing systems. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 11-22, June 1992.
5. G. Bell. Ultracomputers: A Teraflop Before Its Time. Communications of the Association for Computing Machinery, 35(8):26-47, August 1992.
6. G. E. Blelloch. Scans as Primitive Parallel Operations. In Proceedings of International Conference on Parallel Processing, pages 355-362, 1987.
7. R. Cole and O. Zajicek. The APRAM: Incorporating asynchrony into the PRAM model. In Proceedings of the Symposium on Parallel Architectures and Algorithms, pages 169-178, 1989.
8. J. M. Cooley and J. W. Tukey. An algorithm for the machine calculation of complex Fourier series. Math. Comp, 19:297-301, 1965.
9. D. E. Culler, R. M. Karp, D. A. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. Technical Report UCB/CSD 92/713, UC Berkeley, 1992.
10. W. Dally. The J-Machine: A Fine-Grain Concurrent Computer. In IFIP Congress, 1989.
11. W. J. Dally. Performance Analysis of $$-ary n-cube Interconnection Networks. IEEE Transaction on Computers, 39(6):775-785, June 1990.
12. Lenoski D. et al. The Stanford Dash Multiprocessor. IEEE Computer, 25(3):63-79, March 1992.
13. S. Fortune and J. Wyllie. Parallelism in Random Access Machines. In Proceedings of the 10th Annual Symposium on Theory of Computing, pages 114-118, 1978.
14. P. B. Gibbons. A More Practical PRAM Model. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 158-168. ACM, 1989.
15. J. L. Hennessy. MIPS R4000 Overview. In Proc. of the 19th Int'l Symposium on Computer Architecture, Gold Coast, Australia, May 1992.
16. J. L. Hennessy and D. A. Patterson. Computer Architecture-A Quantitative Approach. Morgan Kaufmann, 1990.
17. IEEE. Symposium Record-Hot Chips IV, August 1992.
18. P. Kanellakis and A. Shvartsman. Efficient parallel algorithms can be made robust. In Proceedings of the 8th Symposium on Principles of Distributed Computing, pages 211-221, 1989.
19. R. M. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM Simulation on a Distributed Memory Machine. In Proceedings of the Twenty-Fourth Annual ACM Symposium of the Theory of Computing, pages 318-326, May 1992.
20. R. M. Karp, A. Sahay, E. Santos, and K. E. Schauser. Optimal Broadcast and Summation in the LogP Model. Technical Report UCB/CSD 92/721, UC Berkeley, 1992.
21. Z. M. Kedem, K. V. Palem, and P. G. Spirakis. Efficient robust parallel computations. In Proceedings of the 22nd Annual Symposium on Theory of Computing, pages 138-148, 1990.
22. C. U. Martel and A. Raghunathan. Asynchronous PRAMs with memory latency. Technical report, University of California, Davis, Division of Computer Science, 1991.
23. 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.
24. C. H. Papadimitriou and M. Yannakakis. Towards an Architecture-Independent Analysis of Parallel Algorithms. In Proceedings of the Twentieth Annual ACM Symposium of the Theory of Computing, pages 510-513. ACM, 1988.
25. G. M. Papadopoulos and D. E. Culler. Monsoon: an Explicit Token-Store Architecture. In Proc. of the 17th Annual Int. Symp. on Comp. Arch., Seattle, Washington, May 1990.
26. A. G. Ranade. How to emulate shared memory. In. In Proceedings of the 28th IEEE Annual Symposium on Foundations of Computer Science, pages 185-194, 1987.
27. A. Sahay. Hiding Communication Costs in Bandwidth-Limited Parallel FFT Computation. Technical Report UCB/CSD 92/722, UC Berkeley, 1992.
28. L. Snyder. Type Architectures, Shared Memory, and the Corollary of Modest Potential. In Ann. Rev. Comput. Sci., pages 289-317. Annual Reviews Inc., 1986.
29. R. Subramonian. The influence of limited bandwidth on algorithm design and implementation. In Dartmouth Institute for Advanced Graduate Studies in Parallel Computation (DAGS/PC), June 1992.
30. L. G. Valiant. A Bridging Model for Parallel Computation. Communications of the Association for Computing Machinery, 33(8):103-11, August 1990.
31. T. von Eicken, D. E. Culler, S. C. Goldstein, and K. E. Schauser. Active Messages: a Mechanism for Integrated Communication and Computation. In Proc. of the 19th Int'l Symposium on Computer Architecture, Gold Coast, Australia, May 1992.