The Community for Technology Leaders
4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96) (1996)
PORTUGAL
Jan. 24, 1996 to Jan. 26, 1996
ISBN: 0-8186-7376-1
pp: 0139
J.R. Gonzalez de Mendivil , Dept. of Autom. Control, Electron. & Syst. Eng., Public Univ. of Navarra, Pamplona, Spain
F. Farina , Dept. of Autom. Control, Electron. & Syst. Eng., Public Univ. of Navarra, Pamplona, Spain
J. Villadangos , Dept. of Autom. Control, Electron. & Syst. Eng., Public Univ. of Navarra, Pamplona, Spain
J.R. Garitagoitia , Dept. of Autom. Control, Electron. & Syst. Eng., Public Univ. of Navarra, Pamplona, Spain
ABSTRACT
Abstract: Although the problem of deadlock detection and resolution in distributed systems has been studied in detail during the last years, it is still an open and difficult problem for all but the simplest models. One of the main difficulties in finding adequate solutions in the Multiple-Request model resides in the need to avoid false deadlock resolutions. In this paper we show a distributed solution with the Strong Safety Condition of "only true deadlocks must be detected/resolved". The algorithm was proved to satisfy this safety condition and now we study the liveness conditions the algorithm supports.
INDEX TERMS
concurrency control; system recovery; software fault tolerance; distributed algorithms; safe distributed deadlock resolution algorithm; liveness conditions; strong safety condition
CITATION

F. Farina, J. Gonzalez de Mendivil, J. Garitagoitia and J. Villadangos, "Liveness Conditions for a Safe Distributed Deadlock Resolution Algorithm," 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)(PDP), PORTUGAL, 1996, pp. 0139.
doi:10.1109/EMPDP.1996.500580
87 ms
(Ver 3.3 (11022016))