The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2002 vol.28)
pp: 18-29
ABSTRACT
<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>
INDEX TERMS
distributed deadlock avoidance, partially ordered rank, wait-for graph, concurrency control
CITATION
H. Wu, W.N. Chin, J. Jaffar, "An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model", IEEE Transactions on Software Engineering, vol.28, no. 1, pp. 18-29, January 2002, doi:10.1109/32.979987
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool