The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
How to write parallel programs: a guide to the perplexed
Open accessAbstract
We present a framework for parallel programming, based on three conceptual classes for understanding parallelism and three programming paradigms for implementing parallel programs. The conceptual classes are result parallelism, which centers on parallel computation of all elements in a data structure; agenda parallelism, which specifies an agenda of tasks for parallel execution; and specialist parallelism, in which specialist agents solve problems cooperatively. The programming paradigms center on live data structures that transform themselves into result data structures; distributed data structures that are accessible to many processes simultaneously; and message passing, in which all data objects are encapsulated within explicitly communicating processes. There is a rough correspondence between the conceptual classes and the programming methods, as we discuss. We begin by outlining the basic conceptual classes and programming paradigms, and by sketching an example solution under each of the three paradigms. The final section develops a simple example in greater detail, presenting and explaining code and discussing its performance on two commercial parallel computers, an 18-node shared-memory multiprocessor, and a 64-node distributed-memory hypercube. The middle section bridges the gap between the abstract and the practical by giving an overview of how the basic paradigms are implemented. We focus on the paradigms, not on machine architecture or programming languages: The programming methods we discuss are useful on many kinds of parallel machine, and each can be expressed in several different parallel programming languages. Our programming discussion and the examples use the parallel language C-Linda for several reasons: The main paradigms are all simple to express in Linda; efficient Linda implementations exist on a wide variety of parallel machines; and a wide variety of parallel programs have been written in Linda.
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
A fast algorithm for particle simulations
Greengard, L., & Rokhlin, V (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90140-9 · Cited by 4,868
Implementing remote procedure calls
Birrell, A. D., & Nelson, B. J. (1984) · ACM Transactions on Computer Systems · doi:10.1145/2080.357392 · Cited by 1,829
Monitors: an operating system structuring concept
Hoare, C. A. R. (1974) · Communications of the ACM · doi:10.1145/355620.361161 · Cited by 1,496
Carriero, N., & Gelernter, D. (1989) · Communications of the ACM · doi:10.1145/63334.63337 · Cited by 1,401
Self-citationMULTILISP: a language for concurrent symbolic computation
Halstead, R. H. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/4472.4478 · Cited by 1,073
Hillis, W. D., & Steele, G. L. (1986) · Communications of the ACM · doi:10.1145/7902.7903 · Cited by 899
Fine-grained mobility in the Emerald system
Jul, E., Levy, H., Hutchinson, N., & Black, A. (1988) · ACM Transactions on Computer Systems · doi:10.1145/35037.42182 · Cited by 725
Distributed process groups in the V Kernel
Cheriton, D. R., & Zwaenepoel, W. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214438.214439 · Cited by 353
Parallel Search of Strongly Ordered Game Trees
Marsland, T. A., & Campbell, M. S. (1982) · ACM Computing Surveys · doi:10.1145/356893.356895 · Cited by 151
Structuring parallel algorithms in an MIMD, shared memory environment
Jordan, H. F. (1986) · Parallel Computing · doi:10.1016/0167-8191(86)90028-1 · Cited by 44
Cited by
Carriero, N., & Gelernter, D. (1989) · Communications of the ACM · doi:10.1145/63334.63337 · Cited by 1,401
Self-citationCollaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
Metadata
- Authors
- Carriero, N., & Gelernter, D.
- Venue
- ACM Computing Surveys
- Published
- 1989-09
- Volume
- 21
- Issue
- 3
- Pages
- 323-357
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W1873788119
- Cited by
- 361
- References
- 10
- FWCI
- 26.73
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: How to write parallel programs: a guide to the perplexed. https://app.cochat.ai/papers/10.1145/72551.72553
- The paper
- Carriero, N., & Gelernter, D. (1989). How to write parallel programs: a guide to the perplexed. ACM Computing Surveys. https://doi.org/10.1145/72551.72553
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.