Title :
On Minimum Cost Recovery from System Deadlock
Author :
Leung, Joseph Y -T ; Lai, Edmund K.
Author_Institution :
Department of Electrical Engineering and Computer Science, Northwestern University
Abstract :
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.
Keywords :
Approximation algorithms; NP-complete problems; average-case performance; minimum cost deadlock recovery; system deadlock; time complexity; worst case performance; Costs; Heuristic algorithms; Monitoring; NP-complete problem; Operating systems; Performance analysis; Performance evaluation; Resource management; System recovery; Testing; Approximation algorithms; NP-complete problems; average-case performance; minimum cost deadlock recovery; system deadlock; time complexity; worst case performance;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1979.1675435
