This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSE 120: Homework #3 Spring 2011 1. Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also assume that the context-switching overhead is 0.1 millisecond and that all processes are long-runing tasks. What is the CPU utilization for a round-robin scheduler when: a. The time quantum is 1 millisecond b. The time quantum is 10 milliseconds (For this problem, be sure to state your assumptions and show your work. There are a number of possible interpretations.) 2. Consider the traffic deadlock depicted in Figure 7.9 in the book. a. Show that the four necessary conditions for deadlock indeed hold in this example. b. State a simple rule that will avoid deadlocks in this system. 3. Consider a problem in which there is a producer p and two consumers c1 and c2. The producer produces pairs of values <a, b>. The producer does not have to wait in Put for a consumer, and the monitor will have topairs of values <a, b>....
View Full Document
- Spring '08
- Consumer, Thesaurus, DAG, I/O- bound tasks