Assume that there are : 3 processes P1, P2, & P3 3 Resources R1( two instances), R2 (one instance), & R3 (two instances)
Posted: Sat Nov 27, 2021 2:16 pm
Assume that there are :
3 processes P1, P2, & P3
3 Resources R1( two instances), R2 (one instance), & R3 (two instances)
And the processes make the requests for resources in the following order:
P1 requests R1
P2 requests R2
P1 requests R2
P3 request R3
P3 Request R2
P2 request R3
Draw the resource allocation graph and find whether deadlock exists? Justify your answer.
3 processes P1, P2, & P3
3 Resources R1( two instances), R2 (one instance), & R3 (two instances)
And the processes make the requests for resources in the following order:
P1 requests R1
P2 requests R2
P1 requests R2
P3 request R3
P3 Request R2
P2 request R3
Draw the resource allocation graph and find whether deadlock exists? Justify your answer.