Scribd
Upload
57 views1 page

Chapter 5 Problems 5.9 Why Is It Important For The Scheduler To Distinguish I/O-bound Programs

The document contains 3 problems about scheduling algorithms in operating systems. Problem 5.9 asks why it is important to distinguish between I/O-bound and CPU-bound programs for scheduling. Problem 5.12 asks to draw Gantt charts and calculate turnaround and waiting times for 5 processes under FCFS, SJF, priority, and RR scheduling. Problem 5.18 asks to explain how FCFS, RR, and multilevel feedback queues differ in favoring short processes.

Uploaded by

Gautham Nagendra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
57 views1 page

Chapter 5 Problems 5.9 Why Is It Important For The Scheduler To Distinguish I/O-bound Programs

The document contains 3 problems about scheduling algorithms in operating systems. Problem 5.9 asks why it is important to distinguish between I/O-bound and CPU-bound programs for scheduling. Problem 5.12 asks to draw Gantt charts and calculate turnaround and waiting times for 5 processes under FCFS, SJF, priority, and RR scheduling. Problem 5.18 asks to explain how FCFS, RR, and multilevel feedback queues differ in favoring short processes.

Uploaded by

Gautham Nagendra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Chapter 5 Problems

5.9 Why is it important for the scheduler to distinguish I/O-bound programs


from CPU-bound programs?

5.12 Consider the following set of processes, with the length of the CPU-burst
time given in milliseconds:
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5,
all at time 0.
a. Draw four Gantt charts illustrating the execution of these processes
using FCFS, SJF, a non-preemptive priority (a smaller priority number
implies a higher priority), and RR (quantum = 1) scheduling.
b. What is the turnaround time of each process for each of the scheduling
algorithms in part a?
c. What is the waiting time of each process for each of the scheduling
algorithms in part a?
d. Which of the schedules in part a results in the minimal average

5.18 Explain the differences in the degree to which the following scheduling
algorithms discriminate in favor of short processes:
a. FCFS
b. RR
c. Multilevel feedback queues

You might also like