Can someone help me out with this? Sorry I\'m unable to post the section from th

Question

Can someone help me out with this? Sorry I'm unable to post the section from the textbook.   

Thanks in advance, random internet computer IT Jesus's. You guys are lifesavers.

(P.S. I know this question was already solved at (https://www.chegg.com/homework-help/questions-and-answers/use-deadlock-detection-algorithm-section-642-textbook-modern-operating-systems-answer-prob-q18854234, but I can't read the persons handwriting.)

Use the deadlock detection algorithm in Section 6.4.2 of the textbook to answer this problem. Suppose you have two processes, P1 and P2, and below are there current allocation (C) and request matrices (R), along with resources in existence (E) and resources available (A) matrices. Is there currently a deadlock condition between P1 and P2? Explain your answer. C=0201 R=1202 E=1322 A=0111 1 0 1 0 1 1 1 0

Explanation / Answer

Yes there is a deadlock between P1 and P2 as they both require 1 resources of p type if we consider resorces as (p,q,r,s) and availble resorce of p is zero. Other resources request q,r,s can be satisfied. And P2 is holding on to the request of p and is not able to release p bcause it has not completed and because of this P2 has to wait. Hence both are waiting.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.