Scheduling studio

Give a tiny scheduler four jobs. Compare fairness, waiting time and completion under different rules.

How this experiment works

Round robin cycles through jobs for a fixed quantum. Shortest job first and priority run a selected job to completion. Waiting time is completion minus service time.

What it does not prove

This is a scheduler simulation, not a bootable operating system. All jobs arrive at time zero and have no I/O or switching overhead.

Try this challenge

Find the lowest average waiting time. Does the same strategy give every job an early turn?

Enable JavaScript to run the experiment on your device.