Please enable JavaScript.
Coggle requires JavaScript to display documents.
Chapter 8: Deadlocks - Coggle Diagram
Chapter 8: Deadlocks
Detection Algorithm
Let Work and Finish be vectors of length m and n, respectively Initialize:
-
For i = 1,2, …, n, if Allocationi 0, then
Finish[i] = false; otherwise, Finish[i] = true
-
If no such i exists, go to step 4
-
If Finish[i] == false, for some i, 1 <= i<=n, then the system is in deadlock state. Moreover, if
Algorithm requires an order of O(m x n^2) operations to detect whether the system is in deadlocked state
-
-
-
-
