An efficient distributed deadlock avoidance algorithm for the AND model.

An efficient distributed deadlock avoidance algorithm for the AND model.

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 pi and pj, pi is allowed to wait for process pj iff the rank of pj is greater than that of pi...

Volledige beschrijving

Bibliografische gegevens
Gepubliceerd in:IEEE Transactions on software engineering 28, 1 (2002).
Hoofdauteur: Hui Wu
Formaat: Artikel
Taal:English
Onderwerpen:
AND resource request model.
WFG.
Wait-For Graph.
Concurrency control.
Distributed deadlock avoidance algorithm.
Dynamically modified ranks.
Invariant.
Multidimensional ranks.
Partially ordered rank.
Partially ordered ranks.
Unnecessary process abortion.