The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
System Deadlocks
Open accessAbstract
A problem of increasing importance in the design of large multiprogramming systems is the, so-called, deadlock or deadly-embrace problem. In this article we survey the work that has been done on the treatment of deadlocks from both the theoretical and practical points of view.
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
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
The structure of the “THE”-multiprogramming system
Dijkstra, E. W. (1968) · Communications of the ACM · doi:10.1145/363095.363143 · Cited by 1,094
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1983) · Communications of the ACM · doi:10.1145/357980.357993 · Cited by 676
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1966) · Communications of the ACM · doi:10.1145/365230.365252 · Cited by 575
Prevention of system deadlocks
Habermann, A. N. (1969) · Communications of the ACM · doi:10.1145/363156.363160 · Cited by 321
Synchronization in a parallel-accessed data base
Shoshani, A., & Bernstein, A. J. (1969) · Communications of the ACM · doi:10.1145/363269.363277 · Cited by 38
Self-citation
Cited by
Beyond the chalkboard: computer support for collaboration and problem solving in meetings
Stefik, M., Foster, G., Bobrow, D. G., Kahn, K., Lanning, S., & Suchman, L. (1987) · Communications of the ACM · doi:10.1145/7885.7887 · Cited by 1,031
Readings in Distributed Artificial Intelligence
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07700-6 · Cited by 986
Measurement and correction of systematic odometry errors in mobile robots
Borenstein, J., & Feng, L. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.544770 · Cited by 807
Handling obstacles in goal-oriented requirements engineering
van Lamsweerde, A., & Letier, E. (2000) · IEEE Transactions on Software Engineering · doi:10.1109/32.879820 · Cited by 648
Encapsulation of parallelism in the Volcano query processing system
Graefe, G. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98720 · Cited by 340
Metadata
- Authors
- Coffman, E. G., Elphick, M., & Shoshani, A.
- Venue
- ACM Computing Surveys
- Published
- 1971-06
- Volume
- 3
- Issue
- 2
- Pages
- 67-78
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2294580796
- Cited by
- 799
- References
- 6
- FWCI
- 26.24
- 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.