Consider a system with five processes P0, through P4, and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T0 we Have the following allocation.
|
Process |
Allocation |
Request |
Available |
||||||
|
|
A |
B |
C |
A |
B |
C |
A |
B |
C |
|
P0 |
0 |
1 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
|
P1 |
2 |
0 |
0 |
2 |
0 |
2 |
|
||
|
P2 |
3 |
0 |
3 |
0 |
0 |
0 |
|||
|
P3 |
2 |
1 |
1 |
1 |
0 |
0 |
|||
|
P4 |
0 |
2 |
2 |
0 |
0 |
2 |
|||
If we implement Deadlock detection algorithm we claim that system is ______.
1
Semaphore
2
Deadlock state
3
Circular wait
4
Not in deadlock state