Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
Detecting Arbitrary Stable Properties Using Efficient Snapshots
IEEE Transactions on Software Engineering
The DCS: a new approach to multisystem data-sharing
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Nonintrusive snapshots using thin slices
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
M-Guard: a new distributed deadlock detection algorithm based on mobile agent technology
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Monitoring stable properties in dynamic peer-to-peer distributed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Efficient detection and resolution of deadlocks in distributed databases
Computer Communications
Detecting stable locality-aware predicates
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In distributed databases, deadlocks may occur due to conflicts in data file lockings A system is in a deadlock if and only if there is a directed cycle in its demand graph. However, due to the inherent communication delay in a distributed system, it is not easy to construct a consistent demand graph for a distributed system. In this paper, three deadlock detection protocols are discussed. The first protocol uses two communication phases. The second protocol uses a single communication phase. Based on the second protocol, a one-phase hierarchical deadlock detection protocol is developed.