A distributed deadlock resolution algorithm for the AND model

Author

De Mendívil, José Ramón González ; Fariña, Federico ; Garitagotia, J.R. ; Alastruey, Carlos F. ; Bernabeu-Auban, J.M.

Author_Institution

Dept. de Autom. y Comput., Univ. Publica de Navarra, Pamplona, Spain

Volume

10

Issue

5

fYear

1999

fDate

5/1/1999 12:00:00 AM

Firstpage

433

Lastpage

447

Abstract

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

Keywords

automata theory; concurrency control; distributed processing; AND model; deadlock resolution; distributed deadlock; input-output automata model; liveness; safe deadlock resolution; Abortion; Automata; Computer Society; Fault detection; Fault tolerance; Measurement; Proposals; Resource management; Safety; System recovery;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.770131

Filename

770131