Unformatted text preview: D. What is the average waiting time over all 5 processes. 2. (Difficult) Suppose that a system is running six I/O-bound processes and one CPU-bound process . The I/O-bound processes issue an I/O request once for every 1 ms of CPU time, and each I/O operation requires 5 ms to complete. The context-switching overhead is 0.2ms. Assume that all I/O is blocking; in other words, when a process issues an I/O request, the process goes to a wait queue until the I/O operation is complete. Assume that all I/O bound processes are sharing a single device, and all processes are long-running. What is the percentage of CPU utilization for a round-robin scheduler with a time quantum of A. 2 ms B. 8 ms...
View Full Document
- Spring '08
- Operating Systems, Scheduling algorithm, CPU time, I/O bound processes