Shortest-Process-First (SPF) Scheduling
- Scheduler selects process with smallest time to finish
- Lower average wait time than FIFO
- Reduces the number of waiting processes
- Potentially large variance in wait times
- Nonpreemptive
- Results in slow response times to arriving interactive requests
- Relies on estimates of time-to-completion
- Can be inaccurate or falsified
- Unsuitable for use in modern interactive systems