Time, sliced.
See how a multi-level feedback queue shares CPU time. Change the quantum and compare the order of execution.
Ready. All processes arrive at tick 0.
Execution timeline
THE IDEA
Short jobs get a chance. Longer jobs move down the queues.
This browser demonstration uses three FIFO priority queues with quanta of q, 2q and 4q. A process that uses its entire slice without finishing is demoted. All processes arrive at time zero; there is no I/O or priority boost in this simplified demo.
Based on my C MLFQ Scheduler coursework. The original coursework includes I/O blocking, unblocking and periodic priority boosts. This visual demonstration is a separate JavaScript implementation.
Queues · round-robin scheduling · state transitions