Developer Tools

Process Scheduler

Visualize CPU scheduling algorithms with Gantt charts. Compare FCFS, SJF, SRTF, Round Robin, and Priority scheduling.

Algorithm

FCFS (First Come First Served)

Processes

Gantt Chart

ResultsAvg Turnaround: 12.00Avg Waiting: 7.00

Process	Arrival	Burst	Completion	Turnaround	Waiting
P1	0	6	6	6	0
P2	1	4	10	9	5
P3	2	8	18	16	8
P4	3	2	20	17	15
Average				12.00	7.00

Algorithm Reference

FCFS

Processes run in order of arrival. Simple, no starvation, but can cause convoy effect.

SJF (Non-Preemptive)

Picks the shortest job from ready queue. Optimal average waiting time but can starve long jobs.

SRTF (Preemptive SJF)

Preempts current process if a shorter one arrives. Best average waiting time, most context switches.

Round Robin

Each process gets a fixed time quantum. Fair, good response time, quantum affects performance.

Priority

Lower number = higher priority. Non-preemptive. Can cause starvation of low-priority processes.

Formulas

Turnaround = Completion − Arrival

Waiting = Turnaround − Burst

Verwandte Tools