The DOI matches its OpenAlex record; 12 of the 12 references it cites were found in a registry or an index.
A Bridging Model for Parallel Computation
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Handbook of theoretical computer science
Leeuwen, J. V. (1990) · Medical Entomology and Zoology · Cited by 4,259
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
Ladner, R. E., & Fischer, M. J. (1980) · Journal of the ACM · doi:10.1145/322217.322232 · Cited by 1,281
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
Gottlieb, Grishman, Kruskal, McAuliffe, Rudolph, & Snir (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676201 · Cited by 743
Tight Bounds on the Complexity of Parallel Sorting
Leighton, T. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.5009385 · Cited by 368
A complexity theory of efficient parallel algorithms
Kruskal, C. P., Rudolph, L., & Snir, M. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90192-k · Cited by 229
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
Rajasekaran, S., & Reif, J. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218041 · Cited by 171
Proceedings of the London Mathematical Society
(1879) · Nature · doi:10.1038/019527a0 · Cited by 124
From on-line to batch learning
Littlestone, N. (1989) · Conference on Learning Theory · doi:10.5555/93335.93365 · Cited by 121
Cited by
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
MapReduce: Simplified Data Processing on Large Cluster
Senior Software Developer, A. U., & Dayalan, M. (2018) · International Journal of Research and Engineering · doi:10.21276/ijre.2018.5.5.4 · Cited by 2,948
Metadata
- Authors
- Valiant, L. G.
- Venue
- ACM eBooks
- Publisher
- Association for Computing Machinery
- Published
- 1990-08-01
- Volume
- 33
- Issue
- 8
- Pages
- 103-111
- OpenAlex
- W2045271686
- Cited by
- 3,664
- References
- 12
- FWCI
- 62.09
- Type
- book chapter
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.