OS Concepts · Chapter 5
Seven standalone pages, one per scheduling algorithm from the chapter. Each loads the textbook's own example, animates the Gantt chart building in real time, and lets you edit the process table to see a different outcome.
Strict arrival order. Demonstrates the convoy effect when a long job leads.
FCFS Non-preemptiveShortest burst among arrived processes runs next. Minimizes average waiting time.
SJF PreemptiveSJF's preemptive cousin — a shorter new arrival always takes over.
SRTF Non-preemptiveSmallest priority number runs first. Can starve low-priority jobs.
Priority PreemptiveA higher-priority arrival interrupts whatever is running.
Priority + Preemptive · QuantumFixed time slice per turn, cycling through the ready queue. Adjustable quantum.
RR Preemptive · AdaptiveThree queues of rising quantum; a job that doesn't finish its slice drops a level.
MLFQ