This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Protocols for Deadlock Detection in Distributed Database Systems
November 1982 (vol. 8 no. 6)
pp. 554-557
G.S. Ho, Bell Laboratories
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, Nov. 1982, doi:10.1109/TSE.1982.235884
Usage of this product signifies your acceptance of the Terms of Use.