FIFO ready queue
A process enters at the rear and leaves from the front. An unfinished process returns to the rear after its quantum expires.
What is Round Robin Scheduling?
Round Robin is a preemptive CPU scheduling algorithm. Processes wait in a FIFO ready queue. Each process receives at most one time quantum. If it does not finish, it returns to the rear of the queue.
Scheduling structureFIFO queue
PreemptionAfter each quantum
FairnessEvery ready process gets CPU time
Queue operationO(1)
Scheduler controls
Ready Queue
FRONT — next process
REAR — returning processes
Current Process
Add a process or load the example workload.
Current time0
Ready processes0
Completed0
Context switches0
Process metrics
| Process | Burst | Remaining | Completion | Turnaround | Waiting |
|---|
Execution log
- No scheduler events yet.
Round Robin concepts
Time quantum
A small quantum improves responsiveness but increases context-switch overhead. A large quantum makes Round Robin behave more like First-Come, First-Served.
Turnaround time
Turnaround time is completion time − arrival time. In this simulator, all
added processes arrive at the current scheduler time.
Waiting time
Waiting time is turnaround time − burst time. It measures how long a process
spent waiting rather than executing.
Algorithm summary
| Step | Action |
|---|---|
| 1 | Dequeue the process at the front of the ready queue. |
| 2 | Execute it for min(quantum, remaining time). |
| 3 | If it finishes, record completion and timing metrics. |
| 4 | Otherwise, enqueue it again at the rear. |