HomeComputer ScienceCPU Scheduling & Memory Management

CPU Process Scheduler

Interactive CPU process scheduling simulator: watch FCFS, SJF, Round Robin and Priority scheduling build a live Gantt chart from a queue of processes, with average waiting and turnaround time tracked in real time.

Computer Science2DEasy60 FPS📱 Mobile-adapted⇄ 3D version
operating-systems-computer-science ↗ Open standalone

Process scheduling is one of the core jobs of an operating system's kernel: with only one (or a few) CPU cores and many runnable processes, the scheduler must decide, tick by tick, which process gets to run. This simulator generates a fresh batch of processes with random arrival times, CPU bursts and priorities, then runs them through the algorithm you choose — First-Come-First-Served, Shortest-Job-First, Round Robin or Priority scheduling — drawing the resulting execution order as a live Gantt chart while tracking average waiting time, turnaround time and CPU utilization. Switch algorithms mid-run to see immediately how the same workload behaves differently under each policy.

⚙ Under the hood

Simulate CPU process scheduling algorithms like FCFS, SJF, Round-Robin, and Priority on a live Gantt chart to observe average waiting and turnaround times.

operating-systemscomputer-scienceschedulingmemory-management

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)