CPU Scheduling Simulator
OS Semester VIII
Interactive Simulator

Run any algorithm.
See every number.

Add processes, pick an algorithm, step through or autoplay to see the Gantt chart build live.

Algorithm
Processes execute in the order they arrive. Simple, but can cause high waiting time when a long process is at the front.
Speed
t = 0
Ready
Processes

Lower PR number = higher priority


Formula
TAT = CT − AT
Formula
WT = TAT − BT
SRTF Rule
Preempt if new.BT < curr.RT
Round Robin
Switch every Q units