Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Increasing availability under mutual exclusion constraints with dynamic vote reassignment
ACM Transactions on Computer Systems (TOCS)
Invariant-based verification of a distributed deadlock detection algorithm
IEEE Transactions on Software Engineering
Efficient availability mechanisms in distributed database systems
CIKM '93 Proceedings of the second international conference on Information and knowledge management
On characterization and correctness of distributed deadlock detection
Journal of Parallel and Distributed Computing
On timeout for global deadlock detection in decentralized database systems
Information Processing Letters
Quorum consensus in nested-transaction systems
ACM Transactions on Database Systems (TODS)
Deadlock models and a general algorithm for distributed deadlock detection
Journal of Parallel and Distributed Computing
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Communicating sequential processes
Communications of the ACM
Storage Efficient and Secure Replicated Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
Efficient Detection and Resolution of Generalized Distributed Deadlocks
IEEE Transactions on Software Engineering
Towards Efficient Algorithms for Deadlock Detection and Resolution in Distributed Systems
Proceedings of the Fifth International Conference on Data Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A new deadlock detection algorithms for distributed real-time database systems
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Performance evaluation of the quorum consensus replication method
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
Stochastic analysis of distributed deadlock scheduling
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On Optimal Deadlock Detection Scheduling
IEEE Transactions on Computers
Efficient detection and resolution of OR deadlocks in distributed systems
Journal of Parallel and Distributed Computing
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
On Scalable Synchronization for Distributed Embedded Real-Time Systems
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
Distributed and Parallel Databases
Resource Management in Real Time Distributed System with Security Constraints: A Review
International Journal of Distributed Systems and Technologies
Hi-index | 0.00 |
Replicated databases that use quorum-consensus algorithms to perform majority voting are prone to deadlocks. Due to the P-out-of-Q nature of quorum requests, deadlocks that arise are generalized deadlocks and are hard to detect. We present an efficient distributed algorithm to detect generalized deadlocks in replicated databases. The algorithm performs reduction of a distributed wait-for-graph (WFG) to determine the existence of a deadlock. If sufficient information to decide the reducibility of a node is not available at that node, the algorithm attempts reduction later in a lazy manner. We prove the correctness of the algorithm. The algorithm has a message complexity of $2e$ messages and a worst-case time complexity of $2d+2$ hops, where $e$ is the number of edges and $d$ is the diameter of the WFG. The algorithm is shown to perform significantly better in both time and message complexity than the best known existing algorithms. We conjecture that this is an optimal algorithm, in time and message complexity, to detect generalized deadlocks if no transaction has complete knowledge of the topology of the WFG or the system and the deadlock detection is to be carried out in a distributed manner.