The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1979 vol.28)
pp: 671-677
J.Y.-T. Leung , 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.
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, September 1979, doi:10.1109/TC.1979.1675435
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool