A bridging model for parallel computation
- 1 August 1990
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 33 (8), 103-111
- https://doi.org/10.1145/79173.79181
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.Keywords
This publication has 16 references indexed in Scilit:
- A complexity theory of efficient parallel algorithmsTheoretical Computer Science, 1990
- Communication complexity of PRAMsTheoretical Computer Science, 1990
- Parallel hashingJournal of the ACM, 1988
- Optimally universal parallel computersPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1988
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Efficient Schemes for Parallel CommunicationJournal of the ACM, 1984
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Parallel Prefix ComputationJournal of the ACM, 1980
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963