A survey of distributed deadlock detection algorithms
- 1 September 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 15 (3), 37-45
- https://doi.org/10.1145/15833.15837
Abstract
This paper surveys research work performed within the last five years in distributed deadlock detection. The last survey paper on this topic appeared in 1980; since that time a large number of interesting algorithms have been discribed in the literature. A new, more efficient scheme is the probe-based deadlock detection strategy used by many of the new algorithms. This paper will concentrate on distributed deadlock detection algorithms. Only detection of resource deadlocks will be reviewed here, though other types of deadlock handling strategies and environments are briefly mentioned.Keywords
This publication has 22 references indexed in Scilit:
- Axiomatic semantics of communicating sequential processesACM Transactions on Programming Languages and Systems, 1984
- The Deadlock problemACM SIGOPS Operating Systems Review, 1983
- Distributed deadlock detectionACM Transactions on Computer Systems, 1983
- Deadlock avoidance revisitedJournal of the ACM, 1982
- Distributed deadlock detection algorithmACM Transactions on Database Systems, 1982
- System level concurrency control for distributed database systemsACM Transactions on Database Systems, 1978
- A locking protocol for resource coordination in distributed databasesPublished by Association for Computing Machinery (ACM) ,1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Optimal allocation of resources in distributed information networksACM Transactions on Database Systems, 1976
- System DeadlocksACM Computing Surveys, 1971