Compare classic CPU scheduling algorithms side by side. Edit any process (arrival, burst, priority), pick an algorithm, and watch the Gantt chart update — with per-process turnaround, waiting, and response times.
| PID | Arrival | Burst | Priority |
|---|
| PID | Start | Finish | Turnaround | Waiting | Response |
|---|
FCFS runs each process to completion in arrival order — simple but convoys short jobs behind long ones.
SJF always picks the ready process with the shortest burst next. Provably optimal average waiting time but requires knowing burst lengths and can starve long jobs.
SRTF is preemptive SJF — if a newly arrived process has a shorter remaining time than the running one, the running one is preempted.
Round Robin gives each process a fixed time quantum; when it expires the process goes back to the tail of the ready queue. Fair, low response time, but context-switch overhead grows as the quantum shrinks.
Priority picks the highest-priority ready process. The preemptive variant reschedules whenever a higher-priority process arrives. Both risk starving low-priority tasks without aging.