Deadlock-avoidance algorithm, Operating System

Assignment Help:

Regard as a computer system that runs 5000 jobs per month with no deadlock-prevention or deadlock-avoidance scheme. Deadlocks take place about twice per month and the operator must terminate and rerun about jobs per deadlock. Every job is worth about $2 (in CPU time) and the jobs terminated tend to be about half-done when they are aborted.

A systems programmer has approximated that a deadlock-avoidance algorithm like the banker's algorithm could be installed in the system with a raise in the average execution time per job of about 10 percent. Because the machine currently has 30-percent idle time all 5000 jobs per month could still run although turnaround time would increase by about 20 percent on average.

a. What are the arguments meant for installing the deadlock-avoidance algorithm?

b. What are the arguments alongside installing the deadlock-avoidance algorithm?

Answer: An argument for installing deadlock forestalling in the system is that we could ensure deadlockwould never occurs. Additionally despite the increase in turnaround time all 5000 jobs could still run. An argument alongside installing deadlock avoidance software is that deadlocks take place infrequently and they cost little when they do occur.


Related Discussions:- Deadlock-avoidance algorithm

What is dispatch latency, What is dispatch latency? The time taken by t...

What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.

Briefly discuss on page replacement, Briefly discuss on page replacement? ...

Briefly discuss on page replacement? Page replacement approach is fixed as follows. If no frame is free, we search one that is not presently being used and free it. We can fre

Explain lru approximation page replacement in detail, LRU approximation pag...

LRU approximation page replacement In this we utilize the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for the imp

Networking protocols, Modern networks are not implemented as a single piece...

Modern networks are not implemented as a single piece of software; that would render the task of dealing with multiple technologies and manufacturers virtually impossible. The solu

Basic server model, Suppose we want to program a Web server; we could easil...

Suppose we want to program a Web server; we could easily do so without using concurrency, as follows: while(true) wait connection read from socket and parse url look up url cont

Correct the code for visitor and vehicle portion, Gopher Gallery consists o...

Gopher Gallery consists of a shopping mall and a cart ride that covers the 150 acre habitat. There are m visitors and n single-person vehicles. Visitors stroll around the mall at t

Deadlock-avoidance safety algorithm, Q. Presume that you have coded the de...

Q. Presume that you have coded the deadlock-avoidance safety algorithm as well as now have been asked to implement the deadlock-detection algorithm. Can you do thus by simply usin

Why is rotational optimization no longer consequently useful, UNIX systems ...

UNIX systems utilized to use disk-layout optimizations based on the rotation position of disk data however modern implementations including Linux simply optimize for sequential dat

Micro operation, Ask question maxmum words accepted#

Ask question maxmum words accepted#

Explain the reasons why an organisation fail to plan, Problem 1: (a) Wh...

Problem 1: (a) What are the likely benefits which an organisation may derive from the planning process? (b) Explain the main reasons why an organisation may fail to plan.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd