Question: IV. Using the RAG Algorithm to detect Deadlocks - Draw Corresponding wait for graph and check is this deadlock state. a) Suppose there is only
IV. Using the RAG Algorithm to detect Deadlocks - Draw Corresponding wait for graph and check is this deadlock state. a) Suppose there is only one instance of each resource. P1 has R2 and R3, and is requesting R1 P2 has R4 and is requesting R3 P3 has R1 and is requesting R4 b) Suppose there is only one instance of each resource. P1 has R2, and is requesting R1 and R3 P2 has R4 and is requesting R3 P3 has R1 and is requesting R4 NOTE- Hint- Use a wait-for graph: Collapse resources. An edge Pi - Pk exists only if RAG has Pi - Rj & Rj - Pk Cycle in wait-for graph-deadlock
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
