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

Describe the purpose of the checkpoint mechanism, Describe the purpose of t...

Describe the purpose of the checkpoint mechanism. How habitually must checkpoints be performed? Explain how the frequency of checkpoints affects: System performance while no

What is an i/o subsystem, What is an I/O subsystem? The control of devi...

What is an I/O subsystem? The control of devices connected to the computer is a main issue while designing operating systems. Because I/O deices differ widely in their function

Explain the tlssetvalue (tlsindex, Explain the TlsSetValue (TLSindex, dataP...

Explain the TlsSetValue (TLSindex, dataPtr)Function The TlsSetValue function  associates the  dataPtr passed as a parameter as local storage for the requesting thread. The asso

User threads control dispatching, Consider a particular system that does no...

Consider a particular system that does not have an interrupting clock.  The only way a thread can lose the processor is to voluntarily surrender it.  Additionally, the operating sy

Least-recently used, LRU evicts the page which was last accessed the farthe...

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

Inter-process Communication !, My code it didn''t run properly ,i tried to ...

My code it didn''t run properly ,i tried to pass 2 parameter example : ./a.out ls -ll ,but it execute only the ls instead of the ls -ll ! plz help amd thank you ! #include #inclu

Packets and time division multiplexing (tdm), Broken data into small packet...

Broken data into small packets allow time division multiplexing. In TDM every packet leaves the sender and is switched on the shared interaction channel through a multiplexer. At t

Multiprogramming, how response times are reduced by allowing time sharing o...

how response times are reduced by allowing time sharing on top of multiprogramming

What is the purpose of system programs, What is the purpose of system progr...

What is the purpose of system programs? System programs can be thought of as bundles of useful system calls. They give basic functionality to users and so users do not require

What is preemptive and nonpreemptive scheduling, What is preemptive and non...

What is preemptive and nonpreemptive scheduling? Under nonpreemptive scheduling once the CPU has been allocated to a process, the process keeps the CPU unless it releases the C

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