The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
PVM: A framework for parallel distributed computing
Abstract
The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one or more networks. The participating processors may be scalar machines, multiprocessors, or special‐purpose computers, enabling application components to execute on the architecture most appropriate to the algorithm. PVM provides a straightforward and general inferface that permits the description of various types of algorithms (and their interactions), while the underlying infrastructure permits the execution of applications on a virtual computing environment that supports multiple parallel computation models. PVM contains facilities for concurrent, sequential or conditional execution of application components, is portable to a variety of architectures, and supports certain forms of error detection and recovery.
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
Postel, J. (1980) · doi:10.17487/rfc0768 · Cited by 2,223
A tree-based algorithm for distributed mutual exclusion
Raymond, K. (1989) · ACM Transactions on Computer Systems · doi:10.1145/58564.59295 · Cited by 441
Karp (1987) · Computer · doi:10.1109/mc.1987.1663563 · Cited by 217
Efficient solution to the distributed mutual exclusion problem
Agrawal, D., & Abbadi, A. E. (1989) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/72981.72994 · Cited by 86
Cited by
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 · doi:10.1145/1272996.1273005 · Cited by 2,432
NAMD2: Greater Scalability for Parallel Molecular Dynamics
Kalé, L., Skeel, R., Bhandarkar, M., Brunner, R., Gursoy, A., Krawetz, N., Phillips, J., Shinozaki, A., Varadarajan, K., & Schulten, K. (1999) · Journal of Computational Physics · doi:10.1006/jcph.1999.6201 · Cited by 2,428
SETI@home: an experiment in public-resource computing
Anderson, D. P., Cobb, J., Korpela, E., Lebofsky, M., & Werthimer, D. (2002) · Communications of the ACM · doi:10.1145/581571.581573 · Cited by 1,302
Cilk: an efficient multithreaded runtime system
Blumofe, R. D., Joerg, C. F., Kuszmaul, B. C., Leiserson, C. E., Randall, K. H., & Zhou, Y. (1995) · Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/209936.209958 · Cited by 1,021
Parallelism and evolutionary algorithms
Alba, E., & Tomassini, M. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.800880 · Cited by 823
Szalay, P. G., Müller, T., Gidofalvi, G., Lischka, H., & Shepard, R. (2012) · Chemical Reviews · doi:10.1021/cr200137a · Cited by 725
Implementation of time-dependent density functional response equations
van Gisbergen, S. J. A., Snijders, J. G., & Baerends, E. J. (1999) · Computer Physics Communications · doi:10.1016/s0010-4655(99)00187-3 · Cited by 676
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1272998.1273005 · Cited by 556
Shoring up persistent applications
Carey, M. J., DeWitt, D. J., Franklin, M. J., Hall, N. E., McAuliffe, M. L., Naughton, J. F., Schuh, D. T., Solomon, M. H., Tan, C. K., Tsatalos, O. G., et al. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191915 · Cited by 420
Models and languages for parallel computation
Skillicorn, D. B., & Talia, D. (1998) · ACM Computing Surveys · doi:10.1145/280277.280278 · Cited by 357
Jade: a high-level, machine-independent language for parallel programming
Rinard, M. C., Scales, D. J., & Lam, M. S. (1993) · Computer · doi:10.1109/2.214440 · Cited by 272
An Efficient Privacy-Preserving Outsourced Calculation Toolkit With Multiple Keys
Liu, X., Deng, R. H., Choo, K.-K. R., & Weng, J. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2573770 · Cited by 264
Piccolo: building fast, distributed programs with partitioned tables
Power, R., & Li, J. (2010) · doi:10.5555/1924943.1924964 · Cited by 252
Metadata
- Authors
- Sunderam, V. S.
- Venue
- Concurrency: Practice and Experience
- Publisher
- Wiley
- Published
- 1990-12
- Volume
- 2
- Issue
- 4
- Pages
- 315-339
- ISSN
- 1040-3108 (ISSN-L)
- 1096-9128
- OpenAlex
- W2108167744
- Cited by
- 1,170
- References
- 4
- FWCI
- 30.51
- Type
- journal article
- Language
- en
- Open access
- closed
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.