This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 7 C H A P T E R Deadlocks Practice Exercises 7.1 List three examples of deadlocks that are not related to a computer- system environment. 7.2 Suppose that a system is in an unsafe state. Show that it is possible for the processes to complete their execution without entering a deadlock state. 7.3 Prove that the safety algorithm presented in Section 7.5.3 requires an order of m × n 2 operations. 7.4 Consider a computer system that runs 5,000 jobs per month with no deadlock-prevention or deadlock-avoidance scheme. Deadlocks occur about twice per month, and the operator must terminate and rerun about 10 jobs per deadlock. Each 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 estimated that a deadlock-avoidance algorithm (like the banker’s algorithm) could be installed in the system withanincrease inthe average executiontime perjobofabout10percent....
View Full Document
- Winter '09
- Operating Systems, Computer program, Resource starvation