Question

Tutorial 5 - CPU Scheduling 1. Why is it important for the scheduler to distinguish I/O-bound programs from CPU-bound programs? 2. What is the difference between preemptive and non-preemptive scheduling? 3. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Burst-time Arrival time P1 10 0 P2 2 1 P3 3 2 P4 1 3 P5 5 4 4. Draw the Gantt charts illustrating the execution of these processes using: a) FCFS b) Non-Preemptive SJF c) RR (quantum=2) a) What is the turnaround time of each process for each of the scheduling algorithms in Q3? b) What is the waiting time of each process for each of the scheduling algorithms in Q3? c) Which of the schedules in Q3 results in the minimal average waiting time (over all processes)? 5. Explain the difference in the degree to which the following scheduling algorithms discriminate in favor of short processes. a) FCFS b) RR c) Multilevel feedback queues

          Tutorial 5 - CPU Scheduling
1. Why is it important for the scheduler to distinguish I/O-bound programs from
CPU-bound programs?
2. What is the difference between preemptive and non-preemptive scheduling?
3. Consider the following set of processes, with the length of the CPU-burst time
given in milliseconds:
Process	Burst-time	Arrival time
P1	10	0
P2	2	1
P3	3	2
P4	1	3
P5	5	4
4.
Draw the Gantt charts illustrating the execution of these processes using:
a) FCFS
b) Non-Preemptive SJF
c) RR (quantum=2)
a) What is the turnaround time of each process for each of the scheduling
algorithms in Q3?
b) What is the waiting time of each process for each of the scheduling algorithms
in Q3?
c) Which of the schedules in Q3 results in the minimal average waiting time
(over all processes)?
5. Explain the difference in the degree to which the following scheduling algorithms
discriminate in favor of short processes.
a) FCFS
b) RR
c) Multilevel feedback queues

Tutorial 5 - CPU Scheduling
1. Why is it important for the scheduler to distinguish I/O-bound programs from
CPU-bound programs?
2. What is the difference between preemptive and non-preemptive scheduling?
3. Consider the following set of processes, with the length of the CPU-burst time
given in milliseconds:
Process Burst-time Arrival time
P1 10 0
P2 2 1
P3 3 2
P4 1 3
P5 5 4
4.
Draw the Gantt charts illustrating the execution of these processes using:
a) FCFS
b) Non-Preemptive SJF
c) RR (quantum=2)
a) What is the turnaround time of each process for each of the scheduling
algorithms in Q3?
b) What is the waiting time of each process for each of the scheduling algorithms
in Q3?
c) Which of the schedules in Q3 results in the minimal average waiting time
(over all processes)?
5. Explain the difference in the degree to which the following scheduling algorithms
discriminate in favor of short processes.
a) FCFS
b) RR
c) Multilevel feedback queues

Added by Mckenzie M.

Question

Please give Ace some feedback