hw01 - D. What is the average waiting time over all 5...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 411 Operating Systems II Spring 2009 Homework Assignment #1 To be discussed in class Friday Problems adapted from Silberschatz , Galvin & Gagne 1. (Easy, but long) Given the following set of processes with arrival times, etc. . Smaller priority numbers indicate higher priority. Any tie goes to the lower numbered process. Process Arrival Time (ms) Burst Time (ms) Priority P 1 0.0 10 3 P 2 2.0 5 1 P 3 3.0 7 3 P 4 7.0 4 4 P 5 8.0 3 2 Answer parts A - D for each of the following CPU scheduling algorithms: i. FCFS ii. SJF iii. SRTF iv. preemptive priority v. round-robin: quantum = 2 A. Draw a Gantt chart to illustrate the execution of these processes B. What is the turnaround time for each process? C. What is the waiting time for each process?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

Ask a homework question - tutors are online