the following configuration of processen given in the below table • Which algorithmis) will be used by the systern first in this case? Motivate your answer. • Draw 2 Gantt charts that illustrate the execution of these processes using the following scheduling aigorithms SJF and RR (gquartum2 • What is the walting time of each process for each of these scheduling algorithms? • Which of the algorithms results in the minimum average waiting time (over all processes)? Process ID Arrival Time Burst time Time Quantum Priority P1 21 -19 P2 10 12 P3 14 5. P4 3. 14 12 8. P5

icon
Related questions
Question
Consider the following configuration of processes given in the below table.
• Which algorithmis) will be used by the system first in this case? Motivate your answer.
• Draw 2 Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: SJF and RR (quantum = 2.
What is the waiting time of each process for each of these scheduling algorithms?
• Which of the algorithms results in the minimum average waiting time (over all processes)?
Process ID
Arrival Time
Burst time
Time Quantum
Priority
P1
21
5.
-19
P2
10
12
-5
P3
14
5.
P4
3
14
12
7.
8.
P5
Transcribed Image Text:Consider the following configuration of processes given in the below table. • Which algorithmis) will be used by the system first in this case? Motivate your answer. • Draw 2 Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: SJF and RR (quantum = 2. What is the waiting time of each process for each of these scheduling algorithms? • Which of the algorithms results in the minimum average waiting time (over all processes)? Process ID Arrival Time Burst time Time Quantum Priority P1 21 5. -19 P2 10 12 -5 P3 14 5. P4 3 14 12 7. 8. P5
Expert Solution
steps

Step by step

Solved in 4 steps with 4 images

Blurred answer