The distributed deadlock detection algorithm
ACM Transactions on Computer Systems (TOCS)
A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
Local Distributed Deadlock Detection by Cycle Detection and Clusterng
IEEE Transactions on Software Engineering - Special issue on distributed systems
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
IEEE Transactions on Software Engineering
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
A Distributed Deadlock Detection and Resolution Algorithm and its Correctness Proof
IEEE Transactions on Software Engineering
A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution
IEEE Transactions on Software Engineering
A distributed deadlock detection algorithm: distributed graph reconstruction algorithm
Information Processing Letters
Resolution of Deadlocks in Object-Oriented Distributed Systems
IEEE Transactions on Computers
A distributed deadlock detection algorithm for CSP-like communication
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs
Information Processing Letters
An Efficient Deadlock Avoidance Technique
IEEE Transactions on Computers
Invariant-based verification of a distributed deadlock detection algorithm
IEEE Transactions on Software Engineering
On timeout for global deadlock detection in decentralized database systems
Information Processing Letters
A two-level distributed detection algorithm of AND/OR deadlocks
Journal of Parallel and Distributed Computing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Time efficient deadlock resolution algorithms
Information Processing Letters
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated 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
Proceedings of the Eighth International Conference on Data Engineering
Distributed Deadlock Detection and Resolution with Probes
Proceedings of the 3rd International Workshop on Distributed Algorithms
Proceedings of the IFIP WG10.3 International Conference on Decentralized and Distributed Systems
Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
A deadlock detection and recovery algorithm using the formalism of a directed graph matrix
ACM SIGOPS Operating Systems Review
ACM SIGOPS Operating Systems Review
The generalized deadlock resolution problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An efficient deadlock prevention approach for service oriented transaction processing
Computers & Mathematics with Applications
| Hi-index | 0.00 |
A new rank-based distributed deadlock avoidance algorithm for the AND resource request model is presented. Deadlocks are avoided by dynamically maintaining an invariant $Con(WFG)$: For each pair of processes $p_i$ and $p_j$, $p_i$ is allowed to wait for process $p_j$ iff the rank of $p_j$ is greater than that of $p_i$ for the WFG (Wait-For Graph). Our algorithm neither restricts the order of resource requests nor needs a priori information about resource requests nor causes unnecessary abortion of processes. Multidimensional ranks, which are partially ordered and dynamically modified, are used to drastically reduce the cost of maintaining $Con(WFG)$. Our simulation results show that the performance of our algorithm is better than that of existing algorithms.