Start learning →

Simulators

CPU scheduling simulator

Type the processes (name, arrival time, burst time and, for priority scheduling, a priority), choose an algorithm and step through time to see who runs and who waits.

The simulator

CPU scheduling simulator: how to use it

The Gantt chart, the table of waiting and turnaround times and a comparison of every algorithm update as you type. Supports first-come first-served, shortest job first, shortest remaining time first, priority (with and without preemption) and round robin with any time quantum.

Lessons that use it

  • CPU scheduling: FCFS and SJF (Operating Systems)How the scheduler picks the next process, the measures that judge it (turnaround, waiting and response time), first come first served, and shortest job first.
  • Round robin, SRTF and priority (Operating Systems)Preemptive scheduling with the timer: shortest remaining time first, priority scheduling with aging, round robin and the choice of time quantum, and multilevel queues.

See also