A Fault-Tolerant Distributed Deadlock Detection Algorithm
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
A Semiformal Correctness Proof of a Network Broadcast Algorithm
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Non-blocking concurrency control in distributed database systems
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Distributed deadlock handling for resource allocation in smart spaces
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Efficient detection and resolution of deadlocks in distributed databases
Computer Communications
| Hi-index | 0.00 |
This paper descrbes two protocols for the detection of deadlocks in distributed data bases-a hierarchically organized one and a distributed one. A graph model which depicts the state of execution of all transactions in the system is used by both protocols. A cycle in this graph is a necessary and sufficient condition for a deadlock to exist. Nevertheless, neither protocol requires that the global graph be built and maintained in order for deadlocks to be detected. In the case of the hierarchical protocol, the communications cost can be optimized if the topology of the hierarachy is appropriately chosen.