The Community for Technology Leaders
Green Image
Issue No. 09 - September (1979 vol. 28)
ISSN: 0018-9340
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.
worst case performance, Approximation algorithms, average-case performance, minimum cost deadlock recovery, NP-complete problems, system deadlock, time complexity

J. Leung and E. Lai, "On Minimum Cost Recovery from System Deadlock," in IEEE Transactions on Computers, vol. 28, no. , pp. 671-677, 1979.
99 ms
(Ver 3.3 (11022016))