2) The following processes are bei scheduling algorithm. priority, with a higher

Question

2) The following processes are bei scheduling algorithm. priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system also has an idle task (which consumes no CPU resources and is identified as Pidle). This task has priority 0 and is scheduled whenever the system has no other available processes to run. The length of a time quantum is 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. a. Show the scheduling order of the processes using a Gantt chart b. What is the turnaround time for each process? c. What is the waiting time for each process? d. What is the CPU utilization rate? g scheduled using a preemptive, roundrobin Each process is assigned a numerical va Priority 35 urst 15 rea 55 25 10 30 P4 P5 P6

Explanation / Answer

Gantt chart for the above problem would be :-

| p1 | p1 | pidle | p2 | p2 | p3 | p3 | p4 | p4 | p4 | pidle | pidle | p5 | p6 | p3 | p5 |

0 10 15 20 30 40 50 55 65 75 80 90 95 100 105 110 115

Waiting time for each process :-

P1 -------> 0

P2 -------> 0

P3 -------> 15 + 50 = 65

P4 -------> 0

P5 -------> 0 + 10 = 10

P6 -------> 0

Turn Around time :-

(Burst time + waiting time)

P1 -------> 15

P2 -------> 20

P3 -------> 85

P4 -------> 25

P5 -------> 20

P6 -------> 5

CPU utilization rate :-

115/ 115 + 9(context switches) = 0.927 = 92.7 %

Hope this helps!

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.