0
$\begingroup$

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.

enter image description here

$\endgroup$
0
$\begingroup$

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 & P2 finishes P0 could get R1,R2 (freed by now)

$\endgroup$
  • $\begingroup$ My concern was that if one of the processes gets dead locked, like P1 on R3, then P2 will never get R3 and the whole thing gets dead locked. $\endgroup$ – 8protons May 16 '18 at 17:40

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.