ACM Home Page
Please provide us with feedback. Feedback
A bridging model for parallel computation
Full text PdfPdf (1.10 MB)
Source
Communications of the ACM archive
Volume 33 ,  Issue 8  (August 1990) table of contents
Pages: 103 - 111  
Year of Publication: 1990
ISSN:0001-0782
Author
Leslie G. Valiant  Harvard Univ., Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 48,   Downloads (12 Months): 362,   Citation Count: 242
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/79173.79181
What is a DOI?

ABSTRACT

The success of the von Neumann model of sequential computation is attributable to the fact that it is an efficient bridge between software and hardware: high-level languages can be efficiently compiled on to this model; yet it can be effeciently implemented in hardware. The author argues that an analogous bridge between software and hardware in required for parallel computation if that is to become as widely used. This article introduces the bulk-synchronous parallel (BSP) model as a candidate for this role, and gives results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Aiello, B., Leighton, FT., 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. Pep. CRI 88-14, Computer Science Dept~, Univ. of Southern California, 1988.
 
4
 
5
Carter, J.L. and Wegman, M.N. Universal classes of hash functions. J. Comput. Syst. Sci. 18 (1979) 143-154.
 
6
7
 
8
Gottlieb, A. et al. The NYU ultracomputer-- Designing an MIMD shared memory parallel computer. IEEE 7~ans. Comput. 32, 2 (1983) 175-189.
 
9
Hoeffding, W. Probability inequalities for sums of bounded random variables. Am. Stat. Assoc. J. 58 (1963) 13-30.
10
 
11
 
12
13
 
14
 
15
 
16
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.
 
17
18
 
19
 
20
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.
21
 
22
Siegel, A. On universal classes of fast high performance hash functions. In Proceedings of the Thirtieth IEEE Symposium on Foundations of Computer Science (1989).
 
23
 
24
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.
25
 
26
Valiant, L.G. A scheme for fast parallel communication. SIAM jr. Comput. 11 (1982) 350-361.
 
27
Valiant, L.G. Optimally universal parallel computers. Phil. Trans. R. Soc. Lond. A326 (1988) 373-376.
 
28
Valiant, L.G. Bulk-synchronous parallel computers. In Parallel Processing and Artificial Intelligence, M. Reeve and S.E. Zenith, Eds., Wiley, 1989 15-22.
 
29
30

CITED BY  242


REVIEW

"Ronald J. Watro : Reviewer"

Valiant observes that parallel processing has not made the expected progress in displacing sequential processing in computationally intensive domains. He attributes this failure to the lack of an appropriate bridging model for parallel computa  more...