Abstract
We propose an algorithm for detecting deadlocks among transactions running concurrently in a distributed processing network (i.e., a distributed database system). The proposed algorithm is a distributed deadlock detection algorithm. A proof of the correctness of the distributed portion of the algorithm is given, followed by an example of the algorithm in operation. The performance characteristics of the algorithm are also presented. © 1982, ACM. All rights reserved.
Cite
CITATION STYLE
Obermarck, R. (1982). Distributed Deadlock Detection Algorithm. ACM Transactions on Database Systems (TODS), 7(2), 187–208. https://doi.org/10.1145/319702.319717
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.