Question: 1. A system has Five processes (P1, P2, P3, P4 ,P5) and Four reusable resources (R1, R2, R3, R4). There are three instances of
1. A system has Five processes (P1, P2, P3, P4 ,P5) and Four reusable resources (R1, R2, R3, R4). There are three instances of R1, two instances of R2 ,one instance of R3 and two instances of R4. The allocation of resources for the five processes in the system are given as follows: P1 holds an instance of R1 and is requesting an instance of R2. P2 holds an instance of R2 and is requesting an instance of R3. P3 holds an instance of R3 and is requesting an instance of R4. P4 holds an instance of R2 and R4 and is requesting an instance of R1. P5 holds an instance of R4. i. Draw the resource allocation graph for this situation? ii. Write all the cycle(s) in the graph? iii. Does a deadlock exist? Why? [4.0 Marksl
Step by Step Solution
3.40 Rating (150 Votes )
There are 3 Steps involved in it
I cannot directly draw the resource allocation graph for you but I can describe how you can draw it ... View full answer
Get step-by-step solutions from verified subject matter experts
