On Deadlock Detection in Distributed Systems

Authors:
V. D. Gligor;S. H. Shattuck
Affiliations:
Department of Computer Science, University of Maryland;-
Venue:
IEEE Transactions on Software Engineering
Year:
1980

Citing 0
Cited 4

A Semiformal Correctness Proof of a Network Broadcast Algorithm

COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Non-blocking concurrency control in distributed database systems

PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Efficient detection and resolution of deadlocks in distributed databases

Computer Communications
Design of liveness-enforcing supervisors with simpler structures for deadlock-free operations in flexible manufacturing systems using necessary siphons

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.