5.12 Consider the following set of processes, with the length of the CPU-burst t

Question

5.12 Consider the following set of processes, with the length of the CPU-burst time given in milliseconds Burst Time 10 Process Priority The processes are assumed to have arrived in the order P1, P2, Ps, P4, Ps, all at time 0 a. Draw four Gantt charts illustrating the execution of these pro- cesses using FCFS, SJF, a nonpreemptive priority (a smaller pri- ority number implies a higher priority), and RR (quantum 1) b. What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of the scheduling algorithms in part a? c. d. Which of the schedules in part a results in the minimal average 2 waiting time (over all processes)?

Explanation / Answer

Answer:

All except C

in FCFS processes with longer cpu burst would starve the processes with short cpu burst time vice versa for SJF.. and in priority scheduling higher priority processes might hinder execution of low priority processes for a long time.. but round robin ensures all processes irrespective of burst time gets their turn of execution after a constant time quantum . hence (C)

PLEASE RATE IT IF HELPS ELSE LET ME KNOW YOUR DOUBT.

THANK YOU !!!

Related Questions

Navigate

• Browse (All)
• Browse 5
• Subjects

---

---

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