A Partially Distributed Deadlock Algorithm
Document Type
Article
Publication Date
10-1985
Abstract
In this paper, a partially distributed deadlock detection algorithm [PDDDA] with multiple outstanding requests is presented for use in distributed database systems. This algorithm allows a process to request many resources simultaneously and uses a central controller for detecting multisite deadlocks. The detection of local deadlocks and the maintenance of local deadlock information are performed at each of the local sites. This partially distributed algorithm alleviates the problem of congestion at the central controller in a centralized algorithm and needs fewer messages and smaller storage space than a fully decentralized algorithm. A set of criteria for comparing deadlock detection algorithms are also given and then used to compare PDDDA with a fully decentralized algorithm proposed by Isloor and Marsland.
Repository Citation
Elmagarmid, A. K.,
Sheth, A. P.,
& Liu, M. T.
(1985). A Partially Distributed Deadlock Algorithm. International Journal of Computer & Information Sciences, 14 (5), 307-330.
https://corescholar.libraries.wright.edu/knoesis/825
DOI
10.1007/BF00987040
