This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Deadlock Detection in Distributed Systems
September 1980 (vol. 6 no. 5)
pp. 435-440
V.D. Gligor, Department of Computer Science, University of Maryland
A hierarchically organized and a distributed protocol for deadlock detection in distributed databases are presented in [1]. In this paper we show that the distributed protocol is incorrect, and present possible remedies. However, the distributed protocol remains impractical because "condensations" of "transaction-wait-for" graphs make graph updates difficult to perform. Delayed graph updates cause the occurrence of false deadlocks in this as well as in some other deadlock detection protocols for distributed systems. The performance degradation that results from false deadlocks depends on the characteristics of each protocol.
Index Terms:
out-of-order graph updates, Deadlock detection, delayed graph updates, distributed systems, false deadlocks, on-line protocols, ostensibly blocked transactions
Citation:
V.D. Gligor, S.H. Shattuck, "On Deadlock Detection in Distributed Systems," IEEE Transactions on Software Engineering, vol. 6, no. 5, pp. 435-440, Sept. 1980, doi:10.1109/TSE.1980.230491
Usage of this product signifies your acceptance of the Terms of Use.