Distributed deadlock detection
From MaRDI portal
We describe a simple and efficient algorithm to detect deadlocks in distributed systems. In our model, processes request N resources from a pool of size M. This is a generalization of the well known AND-OR request model. The algorithm is incrementally derived and proven correct. Its communication, computational, and space requirements are lower than those of the best previously known algorithms for the simpler AND-OR model.
Recommendations
- Resolving all deadlocks in distributed systems
- scientific article; zbMATH DE number 97101
- Efficient detection and resolution of OR deadlocks in distributed systems
- On deadlocks of exclusive AND-requests for resources
- A distributed deadlock detection algorithm: Distributed graph reconstruction algorithm
Cites work
Cited in
(35)- A new algorithm for deadlock avoidance
- A distributed deadlock detection algorithm: Distributed graph reconstruction algorithm
- Concurrent common knowledge: Defining agreement for asynchronous systems
- A minimal property for characterizing deadlock-free programs
- Fast decentralized algorithms for resolving conflicts and deadlocks in resource allocation in data processing and control systems
- An incremental approach for detecting distributed deadlocks in the generalized model
- A model for deadlock detection based on automata and languages theory
- Deadlock resolution in wait-for graphs by vertex/arc deletion
- Efficient detection and resolution of OR deadlocks in distributed systems
- scientific article; zbMATH DE number 2089820 (Why is no real title available?)
- scientific article; zbMATH DE number 426137 (Why is no real title available?)
- False Deadlock Detection in Distributed Systems
- A partially distributed deadlock detection algorithm
- Local Distributed Deadlock Detection by Cycle Detection and Clusterng
- scientific article; zbMATH DE number 4056989 (Why is no real title available?)
- scientific article; zbMATH DE number 4058845 (Why is no real title available?)
- A distributed deadlock detection and resolution algorithm and its correctness proof
- A modified priority based probe algorithm for distributed deadlock detection and resolution
- scientific article; zbMATH DE number 97101 (Why is no real title available?)
- scientific article; zbMATH DE number 1203331 (Why is no real title available?)
- scientific article; zbMATH DE number 1953156 (Why is no real title available?)
- Deadlock detection in MPI programs
- Strong stable properties in distributed systems
- On deadlocks of exclusive AND-requests for resources
- The inhibition spectrum and the achievement of causal consistency
- Stochastic analysis of distributed deadlock scheduling
- Distributed Computing – IWDC 2005
- A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity
- Deadlock Detection in the Face of Transaction and Data Dependencies
- Variable timestamp-based distributed deadlock detection and resolution
- Resolving all deadlocks in distributed systems
- Hierarchical deadlock detection for nested transactions
- The distributed simulation of clustered processes
- Extension of the Banker's algorithm for resource allocation in a distributed operating system
- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
This page was built for publication: Distributed deadlock detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100883)
