Resource Allocation Graph: Two processes want the same resource
Where is the problem here?is there a missing edge from ur graph?....As I see it : R3 could be assigned to P1 till it finishes, then to P2 (or vice verca), finally when both P1 &amp; P2 finishes P0 could get R1,R2 (freed by now)