1
$\begingroup$

How can i draw a general resource graph which cannot be completely reduced but which is free from deadlock?

A general resource graph which can be completely reduced and hence is free from deadlock is shown below.

enter image description here

As depicted above, R1 and R2 are resources and P1 and P2 are processes.

$\endgroup$

migrated from cseducators.stackexchange.com Nov 23 '17 at 21:31

This question came from our site for those involved in the field of teaching Computer Science.

  • 1
    $\begingroup$ I see now that you already asked a similar question here, had it closed, and then asked a cleaned-up version on CSE. I suspect that the question is fine now, but for future reference, if you edit your original question, it can be reopened. Closure is considered a temporary measure to give you the opportunity to improve the question before answers start streaming in. (Once they come, it takes away a lot of your flexibility to improve the question) $\endgroup$ – Ben I. Nov 23 '17 at 21:37
  • 1
    $\begingroup$ As was asked the last time you posted this, what have you tried so far? What are your thoughts? What prevents you from answering this yourself? $\endgroup$ – D.W. Nov 24 '17 at 5:07
0
$\begingroup$

A general resource graph which cannot be completely reduced but which is free from deadlock is illustrated below.

R1 and R2 are reusable resources, and P1 and P2 processes.

enter image description here

$\endgroup$

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.