Deadlock-avoidance algorithm, Operating System

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







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
Related Questions
What is co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o


What is the exclusive feature of UNIX Shell is the exclusive feature of UNIX.

How File record length should be chosen File record length should be selected to match the data characteristics

Q. Consider a calculating environment where a unique number is associated with each process and each object in the system. Suppose that we permit a process with number n to acce


Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph.  b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for

VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process. Here if a 10k process enters we are able to make a space of

List the various file attributes. A file has particular other attributes, which vary from one operating system to another, but typically having of these:  Name, identifier, typ

Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.