Chapter $5$: CPU Scheduling

Why is it important for the scheduler to distinguish $\frac{l}{0}-$bound programs from CPU$-$bound programs?

Discuss how the following pairs of scheduling criteria conflict in certain settings.

a$.$ CPU utilization and response time

b$.$ Average turnaround time and maximum waiting time

c$.$ I$/$O device utilization and CPU utilization

Consider the exponential average formula used to predict the length of the next CPU burst. What are the implications of assigning the following values to the parameters used by the algorithm?

a$.Q=0$ and milliseconds

b$.Q=0\mathrm{.}99$ and milliseconds

Consider the following set of processes, with the length of theCPU$-$burst time given in milliseconds:

Process Burst TimePriority

$P_{1}103$

P$211$

$P_{3}23$

P $14$

P$552$

The processes are assumed to have arrived in the order $P_1,P_2,P_3,P_4,P_5,$ all at time $0.$

a$-$Draw four Gantt charts illustrating the execution of these processes using FCFS$,$ SJF$,$ a nonpreemptive 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 thescheduling 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 waiting time $($over all processes$)?$

Which of the following scheduling algorithms could result in starvation?