OSMediumScheduling
Explain Round Robin Scheduling with an Example
đ Problem
Explain how Round Robin CPU scheduling works using 3 processes with burst times 5, 3, 8 and a time quantum of 4.
đ§ Approach
Each process gets the CPU for at most one time quantum (4 units) before moving to the back of the queue. P1 (burst 5) runs 4 units, has 1 left. P2 (burst 3) runs fully in 3 units (needs no more). P3 (burst 8) runs 4 units, has 4 left. Then P1 finishes its remaining 1 unit, then P3 runs its remaining 4 units â this rotation continues until all processes finish.