A system that uses Banker\'s Algorithm deadlock avoidance has four processes and

Question

A system that uses Banker's Algorithm deadlock avoidance has four processes and four different type of resources and there are multiple resources of each type. Is the state of the system shown below at Time 2 safe? If the system If the system is safe then show two possible sequence of processes executions, and if the system is unsafe, show how deadlock might occur. Consider a Virtual Memory Management System and a process with the following page reference string for the process execution: How many page faults would occur for LRU, FIFO and OFT page replacement algorithms if you assume three page frames of Real memory are available for process execution? Explain how a deadlock can be modeled in a computer system and how OS can recognize a system is safe or is deadloced? Assume there are 2 processes, P1 as Producer and P2 as Consumer that are intended to produce 5 items and consume 5 items but one item at a time. Write a sudocode to syncharonize P1 and P2 using a Flag for their synchronization and a Buffer to hold items.

Explanation / Answer

2)FIFO=20 page faults when frame size =3

3)we have to use limited shared resorces and more than one process should point to it .more than one pocess if try to access the shared resource at same time.Then deadlocks will arise.when the OS is not able to allocate resources,the it will recognise it as a deadlock

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

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