loading...
Liveness Conditions for a Safe Distributed Deadlock Resolution Algorithm
PORTUGAL January 24-January 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMPDP.1996.5005804th Euromicro Workshop on Parallel an ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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: 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:
J.R. Gonzalez de Mendivil, F. Farina, J. Villadangos, J.R. Garitagoitia, "Liveness Conditions for a Safe Distributed Deadlock Resolution Algorithm," pdp, pp.0139, 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), 1996
Usage of this product signifies your acceptance of the Terms of Use.