Resolving Distributed Deadlocks in the OR Request Model

Authors:
J. Villadangos;F. Fariña;J. R. González de Mendívil;J. R. Garitagoitia;J. Bernabéu-Aubán;G. Vossen
Affiliations:
-;-;-;-;-;-
Venue:
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Year:
1999

Citing 9
Cited 1

An Efficient Distributed Knot Detection Algorithm

IEEE Transactions on Software Engineering
Deadlock Detection in Distributed Systems

Computer
Distributed algorithm for communication deadlock detection

Information and Software Technology
Characterization and correctness of distributed deadlock detection and resolution

Characterization and correctness of distributed deadlock detection and resolution
A Distributed Deadlock Resolution Algorithm for the AND Model

IEEE Transactions on Parallel and Distributed Systems
A Distributed Graph Algorithm: Knot Detection

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection

ACM Transactions on Computer Systems (TOCS)
A distributed algorithm for the detection of local cycles and knots

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS

HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS

A Safe Algorithm for Resolving OR Deadlocks

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work a new distributed deadlock resolution algorithm for the OR model is proposed. The algorithm verifies the correctness criteria: Safety- false deadlocks are not resolved and Liveness- deadlocks are resolved in finite time.