On Minimum Cost Recovery from System Deadlock

J.Y.-T. Leung; E.K. Lai

doi:10.1109/TC.1979.1675435

Publication
1979
Issue No. 9 - September
Abstract - On Minimum Cost Recovery from System Deadlock

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by J.Y.-T. Leung Articles by E.K. Lai

On Minimum Cost Recovery from System Deadlock

September 1979 (vol. 28 no. 9)

pp. 671-677

	ASCII Text	x
	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.

	BibTex	x
	@article{ 10.1109/TC.1979.1675435, author = {J.Y.-T. Leung and E.K. Lai}, title = {On Minimum Cost Recovery from System Deadlock}, journal ={IEEE Transactions on Computers}, volume = {28}, number = {9}, issn = {0018-9340}, year = {1979}, pages = {671-677}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675435}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - On Minimum Cost Recovery from System Deadlock IS - 9 SN - 0018-9340 SP671 EP677 EPD - 671-677 A1 - J.Y.-T. Leung, A1 - E.K. Lai, PY - 1979 KW - worst case performance KW - Approximation algorithms KW - average-case performance KW - minimum cost deadlock recovery KW - NP-complete problems KW - system deadlock KW - time complexity VL - 28 JA - IEEE Transactions on Computers ER -

J.Y.-T. Leung, Department of Electrical Engineering and Computer Science, Northwestern University

E.K. Lai

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675435

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.