CaltechAUTHORS
Published August 1982 | Version public
Book Section - Chapter Metadata-only

A distributed algorithm for detecting resource deadlocks in distributed systems

Creators

Abstract

This paper presents a distributed algorithm to detect deadlocks in distributed data bases. Features of this paper are (1) a formal model of the problem is presented, (2) the correctness of the algorithm is proved, i.e. we show that all true deadlocks will be detected and deadlocks will not be reported falsely, (3) no assumptions are made other than that messages are received correctly and in order and (4) the algorithm is simple.

Additional Information

© 1982 ACM. This work was supported in part by the Air Force Office of Scientific Research under grant AFOSR 81-0205 and the University Research Institute at The University of Texas. Our work in this general area resulted from reading a seminal paper by Dijkstra and Scholten on termination detection [2] and by later discussions with them. Virgil Gligor showed us that the DDB problem, though apparently simple, was non-trivial and interesting, and led us to the sizable body of work on the subject.

Additional details

Identifiers

Eprint ID
92220
DOI
10.1145/800220.806693
Resolver ID
CaltechAUTHORS:20190111-135906881

Related works

Describes
10.1145/800220.806693 (DOI)

Funding

Air Force Office of Scientific Research (AFOSR)
81-0205
University of Texas

Dates

Created
2019-01-12
Created from EPrint's datestamp field
Updated
2021-11-16
Created from EPrint's last_modified field