A Bridging Model for Parallel Computation
Leslie Gabriel Valiant · ACM eBooks · 1990
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.
Cited by 3,664 works. doi:10.1145/3749740.3749753 Open-access PDF
Authors
References
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Probability Inequalities for sums of Bounded Random Variables
- Universal classes of hash functions
- Probability Inequalities for Sums of Bounded Random Variables
- Handbook of theoretical computer science
- Parallel Prefix Computation
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
- A Scheme for Fast Parallel Communication
- Ultracomputers
- Towards an Architecture-Independent Analysis of Parallel Algorithms