Shortest-Job-First Scheduler

Tags

comp-arch

Is a scheduling algorithm that schedules the jobs with the shortest total CPU time first.

Note: A realistic implementation of this would use the burst-time (number of CPU cycles) needed to finish the program instead. In many cases it may estimate this using an exponentially decaying weighted rolling average based on the previous burst time.

This scheduler leads to an on average decrease in wait and response times, however to be truly effective the scheduler needs to be omniscient and to estimate the burst-iness of a process.