The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - November (1982 vol.8)
pp: 554-557
G.S. Ho , Bell Laboratories
ABSTRACT
In distributed databases, deadlocks may occur due to conflicts in data file lockings A system is in a deadlock if and only if there is a directed cycle in its demand graph. However, due to the inherent communication delay in a distributed system, it is not easy to construct a consistent demand graph for a distributed system. In this paper, three deadlock detection protocols are discussed. The first protocol uses two communication phases. The second protocol uses a single communication phase. Based on the second protocol, a one-phase hierarchical deadlock detection protocol is developed.
INDEX TERMS
hierarchical, Communication protocol, deadlock, demand graph, distributed database
CITATION
G.S. Ho, C.V. Ramamoorthy, "Protocols for Deadlock Detection in Distributed Database Systems", IEEE Transactions on Software Engineering, vol.8, no. 6, pp. 554-557, November 1982, doi:10.1109/TSE.1982.235884
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool