hw01Solutions

Hw01Solutions - CS 411 Operating Systems II Homework Assignment#1 To be discussed in class Spring 2009 Solutions Problems adapted from Silberschatz

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Page 1 of 2 CS 411 Operating Systems II Spring 2009 Solutions Homework Assignment #1 To be discussed in class Problems adapted from Silberschatz, Galvin & Gagne 1. 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? D. What is the average waiting time over all 5 processes. See the spreadsheet representation 2. 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
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/28/2009 for the course CS 411 taught by Professor Staff during the Spring '08 term at Oregon State.

Page1 / 2

Hw01Solutions - CS 411 Operating Systems II Homework Assignment#1 To be discussed in class Spring 2009 Solutions Problems adapted from Silberschatz

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online