← Back to all tools

⚡ OS Process Scheduler

Compare CPU scheduling algorithms with Gantt charts and performance metrics. See how different strategies affect waiting and turnaround times.

Designed with the WJEC specification in mind
CS GCSE §1.7CS A-Level Unit 4
⚙️

Setup

ProcessArrival TimeBurst TimePriority
📖

Scheduling Algorithms

FCFS (First Come First Served): Processes run in arrival order. Simple but can cause long waits (convoy effect).

SJF (Shortest Job First): Shortest burst time goes first. Optimal average wait time but requires knowing burst times in advance.

Round Robin: Each process gets a fixed time slice (quantum). If not finished, it goes to the back of the queue. Fair but overhead from context switching.

Priority: Higher priority processes run first. Risk of starvation for low-priority processes.

New → Ready Ready → Running Running → Waiting Running → Terminated