|
|
|
| n | The resulting
state would be: |
|
| Claimed Allocated Available |
| R1 R2
R3 |
| R1 R2
R3 |
| R1 R2
R3 |
| P1 |
| P2 |
| P3 |
| P4 |
| 3 2
2 |
| 6 1
3 |
| 3 1
4 |
| 4 2
2 |
| 1 0
0 |
| 6 1
2 |
| 2 1
1 |
| 0 0
2 |
| 0 1
1 |
|
|
|
|
|
|
| n | This state is
safe with sequence {P2, P1, |
||||
| P3, P4}. After
P2, we have W = (6,2,3) which |
|||||
| enables the
other processes to finish. |
|||||
| Hence: request
granted. |
|||||
