A Bridging Model for Parallel Computation

Communications of the ACM

Volumn 33, Issue 8, 1990, Pages 103-111

  Valiant, Leslie G ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Bulksynchronous; Design; parallel model

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING - MULTIPROCESSING PROGRAMS;

BULK-SYNCHRONOUS PARALLEL (BSP); PARALLEL COMPUTATION; SEQUENTIAL COMPUTATION;

COMPUTER SYSTEMS, DIGITAL;

EID: 0025467711     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/79173.79181     Document Type: Article

References (31)

1. Aggarwal, A., Chandra, A., and Snir, M. Communication complexity of PRAMs. Theor. Comput. Sci. To be published.
2. Aiello, B., Leighton, F.T., Maggs, B., and Neumann, M. Fast algorithms for bit-serial routing on a hypercube. Manuscript, 1990.
3. Anderson, R.J. and Miller, G.L. Optical communication for pointer based algorithms. Tech. Rep. CRI 88-14, Computer Science Dept., Univ. of Southern California, 1988.
4. Borodin, A. and Hopcroft, J.E. Routing merging
5. and sorting on parallel models of computation. J. Comput. Syst. Sci 30 (1985) 130-145.
6. Carter, J.L. and Wegman, M.N. Universal classes of hash functions. J. Comput. Syst. Sci. 18 (1979) 143-154.
7. Eppstein, D. and Galil, Z. Parallel algorithmic techniques for combinatorial computation. Annu. Rev. Comput. Sci. 3 (1988) 233-83.
8. Gibbons, P.B. A more practical PRAM model. In Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures. (1989) pp. 158-168.
9. Gottlieb, A. et al. The NYU ultracomputer-Designing an MIMD shared memory parallel computer. IEEE Trans. Comput. 32, 2 (1983) 175-189.
10. Hoeffding, W. Probability inequalities for sums of bounded random variables. Am. Stat. Assoc. J. 58 (1963) 13-30.
11. Karlin, A. and Upfal, E. Parallel hashing-An efficient implementation of shared memory. J. ACM 35, 4 (1988) 876-892.
12. Karp, R.M. and Ramachandran, V. A survey of parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. North Holland, Amsterdam, 1990.
13. Kruskal, C.P., Rudolph, L., and Snir, M. A complexity theory of efficient parallel algorithms. Theor. Comput. Sci. To be published.
14. Ladner, R.E. and Fischer, M.J. Parallel prefix computation. J. ACM 27 (1980) 831-838.
15. Leighton, F.T. Tight bounds on the complexity of sorting. IEEE Trans. Comput. C-34, 4 (1985) 344-354.
16. Littlestone, N. From on-line to batch learning. COLT 89, Morgan Kaufmann, San Mateo, CA., (1989) 269-284.
17. Maniloff, E.S., Johnson, K.M., and Reif, J.H. Holographic routing network for parallel processing machines. Society of Photo Optical Instrumentation Engineers (SPIE), Paris, France 1989, V 1136, Holographic Optics II, Principles and Applications, 283-289.
18. Mehlhorn, K. and Vishkin, U. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Inf. 21 (1984) 339-374.
19. Papadimitriou, C.H. and Yannakakis, M. Towards an architecture-independent analysis of parallel algorithms. In Proceedings of the Twentieth ACM Symposium on Theory of Computing (1988) pp. 510-513.
20. Rajasekaran, S. and Reif, J.H. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J. Comput. 18, 3 (1989) 594-607.
21. Ranade, A.G. How to emulate shared memory. In Proceedings of the Twenty-eighth IEEE Symposium on Foundations of Computer Science (1987) pp. 185-194.
22. Schwartz, J.T. Ultracomputers ACM TOPLAS 2 (1980) 484-521.
23. Siegel, A. On universal classes of fast high performance hash functions. In Proceedings of the Thirtieth IEEE Symposium on Foundations of Computer Science (1989).
24. Snyder, L. Type architectures, shared memory, and the corollary of modest potential. Annu. Rev. Comput. Sci. 1, (1986) 289-317.
25. Turing, A.M. On computable numbers with an application to the Entscheidungs problem. In Proceedings of the London Mathematical Society 42 2 (1936) 230-265; correction, ibidem 43 (1937) 544-546.
26. Upfal, E. Efficient schemes for parallel communication. J. ACM 31, 3 (1984) 507-517.
27. Valiant, L.G. A scheme for fast parallel communication. SIAM J. Comput. 11 (1982) 350-361.
28. Valiant, L.G. Optimally universal parallel computers. Phil. Trans. R. Soc. Lond. A326 (1988) 373-376.
29. Valiant, L.G. Bulk-synchronous parallel computers. In Parallel Processing and Artificial Intelligence, M. Reeve and S.E. Zenith, Eds., Wiley, 1989 15-22.
30. Valiant, L.G. General purpose parallel architectures. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., North Holland, Amsterdam 1990.
31. Walker, D.W. Portable programming within a message passing model: the FFT as an example. In Proc. 3rd Conference on Hypercube Concurrent Computers and Applications (1988), ACM Press.