Deadlock Detect Algorithm
Original Publication Date: 1983-Sep-01
Included in the Prior Art Database: 2005-Feb-07
Described is an algorithm for detecting a deadlock condition in the request for shared resources. Since the advent of the concept of sharing resources, programmers have had the problem of deadlock. Programmers have developed "good" programming techniques to help avoid it, but there is always someone that doesn't follow the established programming conventions. An algorithm is described that can be used to detect a deadlock condition and to return this indication to the system. The system can then make a decision to resolve this condition. Deadlock is a condition that occurs when one system is waiting for a resource currently "owned" by a second system which is also waiting for a resource currently owned by the first system.