Title :
Efficient techniques for deadlock resolution in distributed systems
Author :
Chow, Yuan-Chieh ; Kostermeyer, W.F. ; Luo, Kenneth
Author_Institution :
Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA
Abstract :
Resolving a deadlock in a computer system involves choosing processes to terminate or roll back so that the deadlock is eliminated. It is widely known that the problem of finding the minimum number of processes to abort is NP-complete. Two polynomial-time heuristics to resolve deadlocks, the edge cycle method and a method based on enumerating the cycles in the wait-for-graph, are discussed. Simulation results are presented that show these heuristics perform better than several previously reported heuristics
Keywords :
computational complexity; concurrency control; distributed processing; graph theory; operating systems (computers); parallel algorithms; NP-complete; cycle enumeration; deadlock resolution; distributed systems; edge cycle method; polynomial-time heuristics; process roll back; process termination; wait-for-graph; Computational modeling; Computer simulation; Detection algorithms; Distributed computing; Distributed databases; Feedback; Polynomials; Resource management; System recovery; Transaction databases;
Conference_Titel :
Computer Software and Applications Conference, 1991. COMPSAC '91., Proceedings of the Fifteenth Annual International
Conference_Location :
Tokyo
Print_ISBN :
0-8186-2152-4
DOI :
10.1109/CMPSAC.1991.170153
