For actual computer systems available in industry, for example, available resour

Question

For actual computer systems available in industry, for example, available resources as well as demands of processes being run may change over the long run. For example, some new processes may be run, some resources may be changed or replaced, and so son. Assuming that our system uses the banker's algorithm to avoid deadlock, which of the following changes can be made to the system without introducing the possibility of deadlock. Explain your reasoning. (a) Permanently remove resources from the system (available is decreased). (b) Add new resources (available is increased) (c) Add new processes to run (d) Decrease the number of processes running concurrently (e) For a single process, increase the maximum amount of resources that it may request. (f) For a single process, decrease the maximum amount of resources that it may request.

Explanation / Answer

Banker's algorithm is a deadlock avoidance algorithm. All processes declare the resources they are going to need. This declaration is before hand. Resource Allocation Graph tells us which process to run and when to do it.

a) If you remove resources permanently from the system then the processes can't request resources and all processes will be in a wait state forever.

b) Adding new resources will improve availability which will allow multiple resources to run parallely.

c) Adding new processes will increase the resource request which will further impede the processes from getting the resources and will be in wait state for longer time.

d) If you decrease the number of processes running parallely, it may not always be a positive thing as not all parallely running processes may be needing the same resources. So, less processes running parallely might not help always.

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

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