Given the following information obout 5 processes and 4 resources: available r1

Question

Given the following information obout 5 processes and 4 resources: available r1 r2 r3 r4 2 1 0 0 current allocation maximum demand still needs process r1 r2 r3 r4 r1 r2 r3 r4 r1 r2 r3 r4 p1 0 0 1 2 0 0 1 2 p2 2 0 0 0 2 7 5 0 p3 0 0 3 4 6 6 5 6 p4 2 3 5 4 4 3 5 6 p5 0 3 3 2 0 6 5 2 Compute what each process still might request and display in the columns labeled "still needs". Is this system currently in a safe or unsafe state? Why? (5 marks) Is this system currently deadlocked? Why or why not? (hint: Use the resource allocation graph). (4 marks) If a request from p3 arrives for (0, 1, 0, 0), can that request be safely granted immediately? If yes, what is the safe sequence of execution ?

Explanation / Answer

1)

still needs

P1 ->0 0 0 0

P2 ->0 7 5 0

P3->6 6 2 2

P4->2 0 0 2

P5->0 3 2 0

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

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