Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 321

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Prevention of system deadlocks

Open access
Habermann, A. N. · 1969 · Communications of the ACM

Abstract

A well-known problem in the design of operating systems is the selection of a resource allocation policy that will prevent deadlock.Deadlock is the situation in which resources have been allocated to various tasks in such a way that none of the tasks can continue.The various published solutions have been somewhat restrictive: either they do not handle the problem in sufficient generality or they suggest policies which will on occasion refuse a request which could have been safely granted.Algorithms are presented which examine a request in the light of the current allocation of resources and determi.~ewhether or not the granting of the request will introduce the possibility of a deadlock.Proofs given in the appendixes show that the conditions imposed by the algorithms are both necessary and sufficient to prevent deadlock.The algorithms have been successfully used in the THE system.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/363156.363160

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 321

Metadata

Authors
Habermann, A. N.
Venue
Communications of the ACM
Published
1969-07
Volume
12
Issue
7
Pages
373
ISSN
  • 0001-0782 (ISSN-L)
  • 1557-7317
OpenAlex
W2104508180
Cited by
321
References
3
FWCI
36.77
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: Prevention of system deadlocks. https://app.cochat.ai/papers/10.1145/363156.363160
The paper
Habermann, A. N. (1969). Prevention of system deadlocks. Communications of the ACM. https://doi.org/10.1145/363156.363160

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.