Deadlock detection in distributed databases

@article{Knapp1987DeadlockDI,
  title={Deadlock detection in distributed databases},
  author={Edgar Knapp},
  journal={ACM Comput. Surv.},
  year={1987},
  volume={19},
  pages={303-328}
}
  • Edgar Knapp
  • Published 1 December 1987
  • Computer Science
  • ACM Comput. Surv.
The problem of deadlock detection in distributed systems has undergone extensive study. An important application relates to distributed database systems. A uniform model in which published algorithms can be cast is given, and the fundamental principles on which distributed deadlock detection schemes are based are presented. These principles represent mechanisms for developing distributed algorithms in general and deadlock detection schemes in particular. In addition, a hierarchy of deadlock… 

Figures from this paper

Erratum: Deadlock Models and a General Algorithm for Distributed Deadlock Detection
TLDR
This paper deals with the problem of deadlock detection in asynchronous message passing systems in a system model that covers unspecified receptions and non-FIFO channels and abstracts deadlocks by a general deadlock model that has the same modeling power as the OR-AND model.
Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis
TLDR
The extensive experiments carried out indicate that the newly proposed deadlock detection algorithm outperforms the other algorithms in the vast majority of configurations and workloads and, in contrast to all other algorithms, is very robust with respect to differing load and access profiles.
Proof techniques for distributed algorithms for deadlock handling
TLDR
It is shown that the distributed algorithms for deadlock detection can be classified based on the technique used for dissemination of dependency information, namely, top-down or bottom-up, and when presented without details of implementation mechanisms permit proofs of correctness which are simpler.
A survey on distributed deadlock and distributed algorithms to detect and resolve deadlock
TLDR
A comparative study of various distributed algorithms such as B. M. Alom Algorithm and Edge-Chasing Algorithm for deadlock detection and resolution in DDS.
A concurrent distributed deadlock detection/resolution algorithm for distributed systems
TLDR
Performance evaluation shows the time and message complexity of the proposed diffusion-computation algorithm outperforms the existing algorithms under a static WFG.
A decentralized deadlock detection and resolution algorithm for generalized model in distributed systems
TLDR
A new distributed algorithm for detecting generalized deadlocks in distributed systems that reduces the data traffic complexity into constant by using fixed sized messages and minimizes additional messages to resolve deadlocks.
A distributed algorithm for resource deadlock detection
TLDR
A simple algorithm for the problem of deadlock detection in distributed systems is presented that ensures that only one process in the deadlock cycle will detect it, thus simplifying the resolution problem.
An Optimal, Distributed Deadlock Detection and Resolution Algorithm for Generalized Model in Distributed Systems
TLDR
The significant improvement of proposed algorithm over earlier algorithms is that it achieves optimum results using fixed sized messages and minimizes the messages to resolve deadlocks.
Detecting deadlocks in distributed systems
The authors deal with a method for detecting deadlocks in resource sharing for distributed systems. The algorithm is based on sending messages along the edges of the waitfor graph, and is built on a
On Time Complexity of Distributed Algorithms for Generalized Deadlock Detection
TLDR
This paper deals with worst-case one-time complexity analysis of two well known distributed algorithms for generalized deadlock detection of Bracha and Toueg and Kshemkalyani and Singhal.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 68 REFERENCES
Detection Of Deadlocks In Distributed Database Systems
TLDR
The concept of "on-line" deadlock detection is introduced here; using a graph-theoretic model to represent the process interactions, a new algorithm for the immediate detection of deadlocks in distributed databases is proposed.
Distributed deadlock detection in distributed database systems
TLDR
The proposed deadlock detection algorithm has been shown to be correct and more efficient compared to previously proposed algorithms, and the comparison of timestamps in graph edges and messages will prevent false deadlocks.
On Deadlock Detection in Distributed Computing Systems
TLDR
This thesis analyzes four published deadlock detection algorithms for distributed computing systems with respect to their performance in the presence of certain faults and proposes a new deadlocked detection algorithm whose efficiency and fault tolerance are adjustable.
Deadlock detection and resolution in distributed processing systems (ddbms, synchronization)
TLDR
A centralized algorithm that allows transactions to have multiple requests outstanding and an algorithm which combines deadlock detection and avoidance is given, both of which can be used in distributed database systems, as well as in transaction-processing systems.
Dynamic deadlock resolution protocols
  • B. Awerbuch, S. Micali
  • Computer Science
    27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
TLDR
This paper reduces the most general dynamic deadlock resolution problem to a conceptually simpler static problem, in which all actions are known a priori, and shows that the resolution of dynamic deadlocks is not any harder than resolution of the static ones.
A framework for understanding distributed (deadlock detection) algorithms
TLDR
This paper presents a framework for stating, understanding, and proving the correctness of distributed algorithms for decision problems, and suggests new algorithms using the best features of several existing algorithms.
Protocols for Deadlock Detection in Distributed Database Systems
TLDR
A one-phase hierarchical deadlock detection protocol is developed that uses two communication phases and a single communication phase to detect deadlocks in distributed databases.
A distributed algorithm for detecting resource deadlocks in distributed systems
TLDR
A distributed algorithm to detect deadlocks in distributed data bases is presented and the correctness of the algorithm is proved, i.e. all true deadlock will be detected and deadlocks will not be reported falsely.
Locking and Deadlock Detection in Distributed Data Bases
TLDR
Two protocols for the detection of deadlocks in distributed data bases are described–a hierarchically organized one and a distributed one that requires that the global graph be built and maintained in order for deadlocks to be detected.
A distributed algorithm for generalized deadlock detection
TLDR
An efficient distributed algorithm to detect deadlocks in distributed and dynamically changing systems is presented and compares favorably with those of previously known distributed deadlock detection algorithms.
...
1
2
3
4
5
...