Scheduling Algorithms
Shortest Job First (SJF)
- Special case of priority scheduling (priority = expected length of CPU burst)
- Non-preemptive version: scheduler chooses the process with the least amount of work to do (shortest CPU burst).
- Preemptive version: scheduler chooses the process with the shortest remaining time to completion -- a running process can be interrupted.