// CPU SCHEDULING SIMULATORS

interactive step-by-step · all algorithms · os course

Round Robin

Each process gets a fixed time quantum. If not done, it goes to the back of the queue.

TQ = 2 units

SRTF — Shortest Remaining Time First (Preemptive)

Always runs the process with the least remaining burst. Preempts on every new arrival.

Preemptive

SJF — Shortest Job First (Non-Preemptive)

When the CPU is free, picks the arrived process with the shortest burst. Runs to completion.

Non-Preemptive

Priority Scheduling (Non-Preemptive)

When CPU is free, picks the highest-priority arrived process. Runs to completion.

Non-Preemptive Lower # = Higher Priority

Priority Scheduling (Preemptive)

If a higher-priority process arrives, it immediately preempts the running process.

Preemptive Lower # = Higher Priority