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
scattered resposibi;ity and authority -necessity of operation research

Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

Define throughput? Throughput in CPU scheduling is the number of processes that are completed per unit time. For long processes, this rate might be one process per hour; for sh

Page fault is a trap to the software gained by the hardware when a process accesses a page that is goes in the virtual address space, but not added in physical memory. In the har

Explain Deadlock Every process in a set of processes is waiting for an event which only a process in the set can cause.

Explain Processing Predefined Application Protocols Implementing and swift processing of predefined application protocols is sure to improve performance of server - side applic

TURNAROUND TIME

Consider a demand-paging system with the following time-measured utilizations: CPU utilization: 10%, Paging disk: 98%, Other I/O devices: 5%. What does this imply? How to improv

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

Minor page fault :I f the page is loaded in memory at the time the fault is started, but is not checked in the memory management unit as being loaded in memory, then it is named a