This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Locking and Deadlock Detection in Distributed Data Bases
May 1979 (vol. 5 no. 3)
pp. 195-202
D.A. Menasce, Department of Computer Science, University of California
This paper descrbes two protocols for the detection of deadlocks in distributed data bases-a hierarchically organized one and a distributed one. A graph model which depicts the state of execution of all transactions in the system is used by both protocols. A cycle in this graph is a necessary and sufficient condition for a deadlock to exist. Nevertheless, neither protocol requires that the global graph be built and maintained in order for deadlocks to be detected. In the case of the hierarchical protocol, the communications cost can be optimized if the topology of the hierarachy is appropriately chosen.
Index Terms:
graph theory, Data bases, deadlock detection, distributed data bases
Citation:
D.A. Menasce, R.R. Muntz, "Locking and Deadlock Detection in Distributed Data Bases," IEEE Transactions on Software Engineering, vol. 5, no. 3, pp. 195-202, May 1979, doi:10.1109/TSE.1979.234181
Usage of this product signifies your acceptance of the Terms of Use.