Question
Exercise : Evaluate Round Robin (RR) and Multilevel Feedback Queues (MFQ) non-preemptive scheduling algorithms for the following five processes: Process CPU burst time Arrival time
Exercise: Evaluate Round Robin (RR) and Multilevel Feedback Queues (MFQ) non-preemptive scheduling algorithms for the following five processes:
Process | CPU burst time | Arrival time |
P1 | 10 | 0 |
P2 | 12 | 3 |
P3 | 4 | 7 |
P4 | 6 | 11 |
P5 | 3 | 19 |
For RR scheduling, use quantum is Tq=5. For MFQ scheduling, every process enters the first queue. There are 3 queues each using RR scheduling, with time quantum 4, 6, and 8, respectively.
a. Show the timing diagrams of process execution for both algorithms. Indicate when each process arrived, completed, or entered the next queue (in the case of MFQ scheduling).
b. Calculate waiting and turnaround times (Tw and Ttr) for all processes and their average times.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started