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...

Szczegółowa specyfikacja

Opis bibliograficzny
Wydane w:IEEE Transactions on software engineering 28, 1 (2002).
1. autor: Hui Wu
Format: Artykuł
Język:English
Hasła przedmiotowe:
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.