Will a deadlock be possible? If yes, how to prevent the deadlock without change

Question

Will a deadlock be possible? If yes, how to prevent the deadlock without change the nature of the problem? Consider: P1 will : Repeat grab z, x; release z, x; end repeat. P2 will : Repeat grab x, y; release x, y; end repeat. P3 will : Repeat grab y, z; release y, z; end repeat. Will a deadlock be possible? If yes, how to prevent the deadlock without change the nature of the problem? Virtual Memory A computer system is in the Thrashing state: CPU utilization: 20% Virtual Memory swapping pages: 98% Other I/O: 5%. Which of the following will improve CPU utilization? Install Fast CPU. Increase virtual memory size. run more programs stop several programs that are running Install More RAM Install faster hard drive Add cache memory

Explanation / Answer

1) No, they will not go in deadlock position. Reason behind this is:
In every function they are holding / grab resources and immediately they are
relaeasing. So there is no stagnation of resources.

2)
By installing fast cpu ( means increasing configuration)
Increasing virtual memory size (Increasing data)
Install more RAM
Add cache memory

options are: A) B) E) G)

Remaining are not to inrease performance they are to store more data.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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