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

File management, five major activities on file management in operating syst...

five major activities on file management in operating system.? Explain it.?

Explain best fit algorithm, BEST FIT ALGORITHM Here scanning is for th...

BEST FIT ALGORITHM Here scanning is for the finest fit one. Signifies it searches the entire list for the best fit position. For the process therefore in that the process will

Custom memory allocation, Some people write custom memory allocators to mee...

Some people write custom memory allocators to meet their speci?c needs. Although this is not needed for most of the applications, it is also not uncommon. The goal, of course, is t

Multi-level page tables, Multi-level page tables are tree-like structures t...

Multi-level page tables are tree-like structures to hold page tables. As an example, consider a two- level page table, again on a 32-bit architecture with 212 = 4 kbyte pages. Now,

What advantages are there to this two-level directory, What advantages are ...

What advantages are there to this two-level directory? Users are isolated from each other. Users have more freedom in choosing file names.

Define lazy swapper, Define lazy swapper. Rather than swapping the enti...

Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne

Memory management, what is hashed page tables & explain of there work & fig...

what is hashed page tables & explain of there work & figure

Sector sparing, What is sector sparing is proper definition

What is sector sparing is proper definition

Define the main reason to encrypt a file, Define the Main reason to encrypt...

Define the Main reason to encrypt a file Major reason to encrypt a file is secure it for transmission.

Cache replacement policies, The physical memory acts as a cache backed by t...

The physical memory acts as a cache backed by the disk. When the physical memory is full, and we want to read in another page from disk, we have to evict a page from physical memor

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