Operating Systems207810 marksNumerical: Safe state resource allocationVideo solutionHandling Deadlocks
How unsafe state differs from deadlocked state? Consider the following initial state and identify whether requested is granted or denied for the given cases. What will happen if process D requests 1 resource? What will happen if process A requests 1 resource? | Process | Has | Max | |---------|-----
How unsafe state differs from deadlocked state? Consider the following initial state and identify whether requested is granted or denied for the given cases. What will happen if process D requests 1 resource? What will happen if process A requests 1 resource?
| Process | Has | Max |
|---|---|---|
| A | 2 | 6 |
| B | 1 | 5 |
| C | 2 | 3 |
| D | 3 | 8 |
$$\text{Free} = 2$$
[10]
Video solutionBanker's Algorithm: Safe State and Request Check3:02
Speed
Checked against the model answer before publishing.
Process Has Max Need = Max − Has ------------------------------------- A 2 6 4 B 1 5 4 C 2 3 1 D 3 8 5 Free = 2 Total resources $= (2+1+2+3) + 2 = 10$ (single resource type). --- Aspect Unsafe State Deadlocked State -------------------------------------- Definition No guaranteed safe sequence exi...