CPU Scheduling Algorithms

CPU Scheduling Algorithm Configuration

Choose which CPU scheduling algorithm to visualize and analyze.

First Come First Served (FCFS) is the simplest scheduling algorithm. Processes are dispatched according to their arrival time on the ready queue. It's a non-preemptive algorithm. While simple to implement, FCFS can lead to the convoy effect, where short processes get stuck waiting for a long process to finish, potentially increasing the average waiting time.

Select Preemption

Non-Preemptive

Allows a process to run to completion or until it blocks before another process is scheduled.

Preemptive

Allows the operating system to interrupt a currently executing process and move it to a ready state.

Enter space-separated numbers for process arrival times.

Enter space-separated numbers for process burst times.