Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
An Efficient Distributed Knot Detection Algorithm
IEEE Transactions on Software Engineering
Invariant-based verification of a distributed deadlock detection algorithm
IEEE Transactions on Software Engineering
Distributed algorithm for communication deadlock detection
Information and Software Technology
A distributed scheme for dynamic deadlock detection and resolution
Information Sciences: an International Journal
Deadlock models and a general algorithm for distributed deadlock detection
Journal of Parallel and Distributed Computing
A Distributed Deadlock Resolution Algorithm for the AND Model
IEEE Transactions on Parallel and Distributed Systems
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Termination Detection of Diffusing Computations in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Advanced Concepts in Operating Systems
Advanced Concepts in Operating Systems
A distributed algorithm for the detection of local cycles and knots
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Resolving Distributed Deadlocks in the OR Request Model
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Performance study of distributed deadlock detection algorithms for distributed database systems
Performance study of distributed deadlock detection algorithms for distributed database systems
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
On Optimal Deadlock Detection Scheduling
IEEE Transactions on Computers
| Hi-index | 0.01 |
Deadlocks in the OR model are usually resolved by aborting a deadlocked process. Prior algorithms for the same model sometimes abort nodes needlessly wasting computing resources. This paper presents a new deadlock resolution algorithm for the OR model that satisfies the following correctness criteria: (Safety) the algorithm does not resolve false deadlocks; (Liveness) the algorithm resolves all deadlocks in finite time. The communication cost of the algorithm is similar to that of previous nonsafe proposals. The theoretical cost has been validated by simulation. In addition, different algorithm initiation alternatives have been analyzed in order to reduce the latency of deadlocks.