Deadlock Avoidance: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of processes | $n$: number of processes | ||
m: number of resource types | $m$: number of resource types | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
Latest revision as of 07:53, 10 April 2023
Description
A deadlock means that the processing of some parts, once started, cannot finish because each of these parts requests for its advancement some resource(s) currently held by some other part(s) in this set.
In a deadlock avoidance approach, the controller must ensure that the granting of resources to any process will lead to a resulting state which is “safe,” i.e., a state from which all the parts being processed can terminate.
Related Problems
Subproblem: Dining Philosophers Problem
Parameters
$n$: number of processes
$m$: number of resource types
Table of Algorithms
Currently no algorithms in our database for the given problem.