The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Models and languages for parallel computation
Open accessAbstract
We survey parallel programming models and languages using six criteria to assess their suitability for realistic portable parallel programming. We argue that an ideal model should by easy to program, should have a software development methodology, should be architecture-independent, should be easy to understand, should guarantee performance, and should provide accurate information about the cost of programs. These criteria reflect our belief that developments in parallelism must be driven by a parallel software industry based on portability and efficiency. We consider programming models in six categories, depending on the level of abstraction they provide. Those that are very abstract conceal even the presence of parallelism at the software level. Such models make software easy to build and port, but efficient and predictable performance is usually hard to achieve. At the other end of the spectrum, low-level models make all of the messy issues of parallel programming explicit (how many threads, how to place them, how to express communication, and how to schedule communication), so that software is hard to build and not very portable, but is usually efficient. Most recent models are near the center of this spectrum, exploring the best tradeoffs between expressiveness and performance. A few models have achieved both abstractness and efficiency. Both kinds of models raise the possibility of parallelism as part of the mainstream of computing.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Handbook of theoretical computer science
Leeuwen, J. V. (1990) · Medical Entomology and Zoology · Cited by 4,259
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
Kung (1982) · Computer · doi:10.1109/mc.1982.1653825 · Cited by 2,272
Actors: A Model of Concurrent Computation in Distributed Systems
Agha, G. (1986) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,232
Jaffar, J., & Lassez, J.-L. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41635 · Cited by 1,597
Parallel Program Design: A Foundation
Chandy, K. M. (1988) · Medical Entomology and Zoology · Cited by 1,539
LogP: towards a realistic model of parallel computation
Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K. E., Santos, E., Subramonian, R., & von Eicken, T. (1993) · Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '93 · doi:10.1145/155332.155333 · Cited by 1,496
Actors: A Model of Concurrent Computation in Distributed Systems
Agha, G. (1986) · The MIT Press eBooks · doi:10.7551/mitpress/1086.001.0001 · Cited by 1,401
PVM: A framework for parallel distributed computing
Sunderam, V. S. (1990) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330020404 · Cited by 1,170
Memory coherence in shared virtual memory systems
Li, K., & Hudak, P. (1989) · ACM Transactions on Computer Systems · doi:10.1145/75104.75105 · Cited by 1,167
Algorithmic skeletons : structured management of parallel computation
Cole, M. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 866
Parallel program design: a foundation
Jesshope, C. (1989) · Microprocessors and Microsystems · doi:10.1016/0141-9331(89)90152-x · Cited by 841
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
Parallel Algorithms for Shared-Memory Machines
Karp, R. M., & Ramachandran, V. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50022-9 · Cited by 687
An Introduction to the Theory of Lists
Bird, R. S. (1987) · Logic of Programming and Calculi of Discrete Design · doi:10.1007/978-3-642-87374-4_1 · Cited by 605
Big Omicron and big Omega and big Theta
Knuth, D. E. (1976) · ACM SIGACT News · doi:10.1145/1008328.1008329 · Cited by 592
Scans as primitive parallel operations
Blelloch, G. E. (1989) · IEEE Transactions on Computers · doi:10.1109/12.42122 · Cited by 538
Vector models for data-parallel computing
Blelloch, G. E. (1990) · Cited by 472
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Programming languages for distributed computing systems
Bal, H. E., Steiner, J. G., & Tanenbaum, A. S. (1989) · ACM Computing Surveys · doi:10.1145/72551.72552 · Cited by 423
The semantic foundations of concurrent constraint programming
Saraswat, V., Rinard, M., & Panangaden, P. (1991) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/99583.99627 · Cited by 384
Ueda, K. (1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-16479-0_17 · Cited by 330
Parallel programming using skeleton functions
Darlington, J., Field, A. J., Harrison, P. G., Kelly, P. H. J., Sharp, D. W. N., Wu, Q. H., & While, R. L. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56891-3_12 · Cited by 274
General Purpose Parallel Architectures
VALIANT, L. G. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50023-0 · Cited by 225
A gentle introduction to Haskell
Hudak, P., & Fasel, J. H. (1992) · ACM SIGPLAN Notices · doi:10.1145/130697.130698 · Cited by 206
Concurrent Prolog: A Progress Report
Shapiro (1986) · Computer · doi:10.1109/mc.1986.1663307 · Cited by 196
Jones, G. A., & Goldsmith, M. H. (1987) · Medical Entomology and Zoology · Cited by 169
The CODE 2.0 graphical parallel programming language
Newton, P., & Browne, J. C. (1992) · International Conference on Supercomputing · doi:10.1145/143369.143405 · Cited by 125
Halstead (1986) · Computer · doi:10.1109/mc.1986.1663306 · Cited by 102
Semantic foundations of concurrent constraint programming
Saraswat, V., Rinard, M., & Panangaden, P. (1995) · Cited by 89
Parallel logic programming systems
de Kergommeaux, J. C., Codognet, P., & Institut National de Recherche en Informatique et en Automatique (INRIA), 7. R. (. U. D. R. D. R. (1992) · HAL · Cited by 85
Chien, A. A., & Dally, W. J. (1990) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/99163.376303 · Cited by 85
José Meseguer, B., & Winkler, T. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55160-3_49 · Cited by 56
The performance of parallel Prolog programs
Fagin, B. S., & Despain, A. M. (1990) · IEEE Transactions on Computers · doi:10.1109/12.61072 · Cited by 12
MOVIE model for open‐systems‐based high‐performance distributed computing
Furmanski, W., Faigle, C., Haupt, T. A., Niemiec, J., Podgórny, M., & Simoni, D. A. (1993) · Concurrency Practice and Experience · doi:10.1002/cpe.4330050406 · Cited by 4
MOVIE model for open systems based high performance distributed computing
Faigle, C., Furmanski, W., Haupt, T. A., Niemiec, J., Podgórny, M., & Simoni, D. A. (2003) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1109/hpdc.1992.246488 · Cited by 3
A survey of PARLOG and Concurrent Prolog: The integration of logic and parallelism
Talia, D. (1993) · Computer Languages · doi:10.1016/0096-0551(93)90024-u · Cited by 2
Self-citation
Cited by
Collaboration 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
Kittur, A., Nickerson, J. V., Bernstein, M., Gerber, E., Shaw, A., Zimmerman, J., Lease, M., & Horton, J. (2013) · Proceedings of the 2013 conference on Computer supported cooperative work · doi:10.1145/2441776.2441923 · Cited by 1,034
(2010) · Springer eBooks · doi:10.1007/978-1-4419-6524-0 · Cited by 519
Google’s MapReduce programming model — Revisited
Lämmel, R. (2008) · Science of Computer Programming · doi:10.1016/j.scico.2007.07.001 · Cited by 489
CrowdForge: crowdsourcing complex work
Kittur, A., Smus, B., & Kraut, R. (2011) · CHI '11 Extended Abstracts on Human Factors in Computing Systems · doi:10.1145/1979742.1979902 · Cited by 434
Metadata
- Authors
- Skillicorn, D. B., & Talia, D.
- Venue
- ACM Computing Surveys
- Published
- 1998-06
- Volume
- 30
- Issue
- 2
- Pages
- 123-169
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2155882878
- Cited by
- 357
- References
- 40
- FWCI
- 25.72
- 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
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.