Deadlock avoidance
Revision as of 10:55, 10 October 2022 by Admin (talk | contribs) (Created page with "== Problem Description== The deadlock Avoidance method is used by the operating system in order to check whether the system is in a safe state or in an unsafe state and in order to avoid the deadlocks, the process must need to tell the operating system about the maximum number of resources a process can request in order to complete its execution. == Bounds Chart == 1050px == Step Chart == File:Deadlock_avoidanceStepChart.png...")
Problem Description
The deadlock Avoidance method is used by the operating system in order to check whether the system is in a safe state or in an unsafe state and in order to avoid the deadlocks, the process must need to tell the operating system about the maximum number of resources a process can request in order to complete its execution.
Bounds Chart
Step Chart
Improvement Table
| Complexity Classes | Algorithm Paper Links | Lower Bounds Paper Links |
|---|---|---|
| Exp/Factorial | ||
| Polynomial > 3 | ||
| Cubic | ||
| Quadratic | [ Banker's Algorithm (1966)] | |
| nlogn | ||
| Linear | ||
| logn |