Consider the following set of processes, with the arrival timeand the length of the CPU burst time given in milliseconds:
Process#
1
2
3
4
5
Arrival Time
0
1
2
3
4
CPU burst Time
2
10
8
4
3
Please do the following items for all three algorithms we havestudied: FCFS, SJF, & SRTF
(When the processes have the same burst or remaining time in SJFor SRTF, FCFS will be applied to select the process forexecution)
a) Draw the Gantt chart;
b) Fill in the table below;
Process#
1
2
3
4
5
Arrival Time
0
1
2
3
4
Finish Time
Response Time
CPU burst Time
2
10
8
4
3
Wait Time
c) Calculate the average waiting time, average response time,throughput, and
average (Response Time/CPU burst time).
Answer
FCFS: First Come First Serve:Whichever the process comes first, it will be served
OR
OR