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.

Posted Date: 7/27/2013 5:02:10 AM | Location : United States

Ask an Expert

Related Discussions:- Deadlock-avoidance algorithm, Assignment Help, Ask Question on Deadlock-avoidance algorithm, Get Answer, Expert's Help, Deadlock-avoidance algorithm Discussions

Write discussion on Deadlock-avoidance algorithm
Your posts are moderated

Write your message here..

Related Questions

Develop the material requirements plan, The following information is availa... The following information is available for three MPS (Master Product Scheduling) items: Product A                            An 80 unit order is to be started in Week 3.

Declare some applications of open source systems, Declare some Applications... Declare some Applications of Open Source Systems • Finance • Educational • Data Storage and Management • ERP (Enterprise Resource Planning) •File Sharing & FTP

Diehard allocator - custom allocators, Allocators can also be used to avoid... Allocators can also be used to avoid problems with unsafe languages. C and C++ are pervasive, with huge amounts of existing code. They are also memory-unsafe languages, in that the

What is a relocatable program, What is a Relocatable program? The Reloc... What is a Relocatable program? The Relocatable programs can be loaded almost anywhere in memory.

Define the server communications module or scm, Define the Server Communica... Define the Server Communications Module or SCM The Server Communications Module (SCM) performs many necessary functions. The SCM responsible for establishing, maintaining, and

Naming scheme for servers in an enterprise, Problem: Within a corporate... Problem: Within a corporate environment, there are usually many servers located across various departments. Naming of servers is often a tedious task. In many circumstances, w

Quick, why we say " OS is a resource allocator" and “OS is a control progr... why we say " OS is a resource allocator" and “OS is a control program"?

Define dynamic linking, Define dynamic linking. Dynamic linking is same... Define dynamic linking. Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually use

Explain the real time operating system, Explain the Real Time Operating Sys... Explain the Real Time Operating System A real-time operating system comprises definite, fixed time constraints. Processing should be done in the defined constraints, or the sys

Calculate the average waiting time, Calculate the Average Waiting Time ... Calculate the Average Waiting Time CPU burst time points out the time, the process needs the CPU. The subsequent are the set of processes with their respective CPU burst time (