the FCFS, SJF, and RR (quantum = 8 milliseconds) scheduling algorithms
Consider the FCFS, SJF, and RR (quantum = 8 milliseconds) scheduling
set of processes.
Process Burst Time
P1 8
P2 25
P3 3
P4 7
P5 11
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
a) Draw Gantt charts that illustrate the execution of these processes using the following
scheduling algorithms: FCFS, SJF, and RR.
b) What is the waiting time of each process for each of these scheduling algorithms?
c) Which of the algorithms results in the minimum average waiting time (overall
processes)?
d) Derive the Need (max-Alloc) matrix. It should be presented like the Allocation or
Maximum matrices above.
e) If the request from process P1 arrives for (0,1,2,0), can the request be granted? Why?
Step by step
Solved in 2 steps with 4 images