Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/a-bridging-model-for-parallel-computation-sXHUSXcOCi
References (31)
-
A. Borodin, J. Hopcroft (1985)
Routing, Merging, and Sorting on Parallel Models of ComputationJ. Comput. Syst. Sci., 30
-
Phillip Gibbons (1989)
A more practical PRAM model -
A. Ranade (1991)
How to emulate shared memory28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
-
A. Siegel (1989)
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications30th Annual Symposium on Foundations of Computer Science
-
D. Eppstein, Z. Galil (1988)
Parallel Algorithmic Techniques for Combinatorial Computation -
W. Hoeffding (1963)
Probability inequalities for sum of bounded random variables -
Richard Anderson (1988)
Optical Communication for Pointer Based Algorithms -
C. Kruskal, L. Rudolph, M. Snir (1990)
A Complexity Theory of Efficient Parallel AlgorithmsTheor. Comput. Sci., 71
-
W. Aiello, F. Leighton, B. Maggs, M. Newman (1990)
Fast algorithms for bit-serial routing on a hypercubeMathematical systems theory, 24
-
N. Littlestone (1989)
From on-line to batch learning -
F. Leighton (1984)
Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, C-34
-
L. Valiant (1988)
Optimally universal parallel computersPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 326
-
Theor: Compul. Sci To be published -
A. Gottlieb, R. Grishman, C. Kruskal, K. McAuliffe, L. Rudolph, M. Snir (1983)
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel ComputerIEEE Transactions on Computers, C-32
-
A. Turing (1937)
On computable numbers, with an application to the EntscheidungsproblemProc. London Math. Soc., s2-42
-
Topics include object-oriented programming languages, application systems, operational object-oriented database systems, architectural issues, and directions in future research and development -
L. Snyder (1986)
Type architectures, shared memory, and the corollary of modest potential, 1
-
Acta If: ZI(l984) 339-374 -
L. Valiant (1991)
General Purpose Parallel Architectures -
S. Rajasekaran, J. Reif (1989)
Optimal and Sublogarithmic Time Randomized Parallel Sorting AlgorithmsSIAM J. Comput., 18
-
Anna Karlin, E. Upfal (1988)
Parallel hashing: an efficient implementation of shared memoryJ. ACM, 35
-
E. Maniloff, K. Johnson, J. Reif (1989)
Holographic Routing Network For Parallel Processing Machines, 1136
-
R. Karp (1988)
A Survey of Parallel Algorithms for Shared-Memory Machines -
L. Carter, M. Wegman (1979)
Universal Classes of Hash FunctionsJ. Comput. Syst. Sci., 18
-
D. Walker (1989)
Portable programming within a message-passing model: the FFT as an example -
R. Ladner, M. Fischer (1980)
Parallel Prefix ComputationJournal of the ACM (JACM), 27
-
A. Aggarwal, A. Chandra, M. Snir (1990)
Communication Complexity of PRAMsTheor. Comput. Sci., 71
-
E. Upfal (1984)
Efficient Schemes for Parallel CommunicationJ. ACM, 31
-
A collaborative effort with Addison- Wesley) l Spring 1989 l 624 pp. l ISBN O-201 -1441 O-7 hardcover l Order Code 704892 l ACM Members $38 -
A. Borodin, J. Hopcroft (1982)
Routing, merging and sorting on parallel models of computation -
L. Valiant (1982)
A Scheme for Fast Parallel CommunicationSIAM J. Comput., 11
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1990 by ACM Inc.
- ISSN
- 0001-0782
- DOI
- 10.1145/79173.79181
- Publisher site
- See Article on Publisher Site
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.
Journal
Communications of the ACM – Association for Computing Machinery
Published: Aug 1, 1990