The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1999 vol.10)
pp: 433-447
ABSTRACT
<p><b>Abstract</b>—Previous proposals for Distributed Deadlock Detection/Resolution algorithms for the AND model have the main disadvantage of resolving false deadlocks, that is, nonexisting or currently being resolved deadlocks. This paper provides an algorithm free of false deadlock resolutions. A simple specification for a safe deadlock resolution algorithm is introduced, and the new distributed solution is developed in a hierarchical fashion from its abstract specification. The algorithm is probe-based, uses node priorities, and coordinates the actions of resolvers so that false deadlocks are not resolved. The solution is formally proven correct by using the Input-Output Automata Model. Finally, a study about the liveness of the algorithm is provided.</p>
INDEX TERMS
Deadlock detection/resolution, distributed systems, AND model, hierarchical correctness proofs, input/output automata model.
CITATION
Jose Ramon Gonzalez de Mendivil, Federico Fariña, Jose Ramon Garitagoitia, Carlos F. Alastruey, J. M. Bernabeu-Auban, "A Distributed Deadlock Resolution Algorithm for the AND Model", IEEE Transactions on Parallel & Distributed Systems, vol.10, no. 5, pp. 433-447, May 1999, doi:10.1109/71.770131
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool