The Community for Technology Leaders
Green Image
<p>A new rank-based distributed deadlock avoidance algorithm for the <it>AND</it> resource request model is presented. Deadlocks are avoided by dynamically maintaining an invariant <tmath>$Con(WFG)$</tmath>: For each pair of processes <tmath>$p_i$</tmath> and <tmath>$p_j$</tmath>, <tmath>$p_i$</tmath> is allowed to wait for process <tmath>$p_j$</tmath> iff the rank of <tmath>$p_j$</tmath> is greater than that of <tmath>$p_i$</tmath> for the <it>WFG</it> (<it>Wait-For Graph</it>). 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 <tmath>$Con(WFG)$</tmath>. Our simulation results show that the performance of our algorithm is better than that of existing algorithms.</p>
distributed deadlock avoidance, partially ordered rank, wait-for graph, concurrency control
W.N. Chin, H. Wu, J. Jaffar, "An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model", IEEE Transactions on Software Engineering, vol. 28, no. , pp. 18-29, January 2002, doi:10.1109/32.979987
99 ms
(Ver 3.3 (11022016))