Resource Allocation Graph: Two processes want the same resource In the example below, is this guaranteed to be safe? I see two processes that require the same resource. It's not a direct cycle but it seems to be a possible deadlock where P0 could get held up.
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)