An efficient distributed deadlock avoidance algorithm for the AND model

Author

Wu, Hui ; Chin, Wei-Ngan ; Jaffar, Joxan

Author_Institution

Sch. of Comput., Nat. Univ. of Singapore, Singapore

Volume

28

Issue

1

fYear

2002

fDate

1/1/2002 12:00:00 AM

Firstpage

18

Lastpage

29

Abstract

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

Keywords

concurrency control; distributed algorithms; graph theory; processor scheduling; resource allocation; 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; System recovery;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.979987

Filename

979987