Consider the processes with given arrival times, burst times and priorities as below Process Arrival time Burst time Priority P0 0 10 3 P1 0 5 5 P2 10 10 2 P3 10 1 1 Assume the OS is using the following CPU scheduling algorithms. (a) FIFO (b) Round Robin with quantum = 5 ms (c) Priority scheduling Calculate the waiting and turnaround times for each process for each of the algorithms above. Provide the Gantt charts in
Consider the processes with given arrival times, burst times and priorities as below
|
Process |
Arrival time |
Burst time |
Priority |
|
P0 |
0 |
10 |
3 |
|
P1 |
0 |
5 |
5 |
|
P2 |
10 |
10 |
2 |
|
P3 |
10 |
1 |
1 |
Assume the OS is using the following CPU scheduling
(a) FIFO
(b) Round Robin with quantum = 5 ms
(c) Priority scheduling
Calculate the waiting and turnaround times for each process for each of the algorithms above. Provide the Gantt charts in your answers for each of the algorithms to show the execution of the processes. Fill in the columns in the format below for the waiting time and turnaround time
Turnaround time and waiting time
|
Process ID |
Waiting Time |
Turnaround Time |
|
P1 |
|
|
|
P2 |
|
|
|
P3 |
|
|
|
P4 |
|
|
Average waiting time =
Average turnaround time =
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
