This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Minimum Cost Recovery from System Deadlock
September 1979 (vol. 28 no. 9)
pp. 671-677
J.Y.-T. Leung, Department of Electrical Engineering and Computer Science, Northwestern University
In this paper we consider the problem of finding a minimum cost deadlock recovery. We show that the problem is NP-complete and hence an efficient algorithm is unlikely to exist for this problem. We propose three fast heuristics and analyze their worst case performance relative to optimal solutions. Finally, we perform some simulation tests to get a feel for the average performance of these heuristics.
Index Terms:
worst case performance, Approximation algorithms, average-case performance, minimum cost deadlock recovery, NP-complete problems, system deadlock, time complexity
Citation:
J.Y.-T. Leung, E.K. Lai, "On Minimum Cost Recovery from System Deadlock," IEEE Transactions on Computers, vol. 28, no. 9, pp. 671-677, Sept. 1979, doi:10.1109/TC.1979.1675435
Usage of this product signifies your acceptance of the Terms of Use.