Question: Suppose you have the following processes: Process Arrival Time Burst Time P1 0 14 P2 2 10 P3 3 2 P4 5 7 PS 7
Suppose you have the following processes: Process Arrival Time Burst Time P1 0 14 P2 2 10 P3 3 2 P4 5 7 PS 7 13 mo ER CPU Use the following multilevel feedback queue CPU scheduling algorithm to execute the above processes: RCPU Queue 1: using RR CPU scheduling algorithm with Q = 4 ms, FS CPI Queue 2: using RR CPU scheduling algorithm with Q = 6 ms, and Queue 3: using FCFS CPU scheduling algorithm. Quart 4 quara - 6 art FCFS ng to ex 1. Draw the Gantt Chart for Queue 2. 2. Find the total waiting time for process P2. Hint 1: Once a process executed using one queue it should go direct to start execution in the next queue this queue is free. Hint 2: The starting time is 0 for Queue 1 only and it is different in all remaining queues. 30
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
