Scheduling Algorithms
Shortest Job First (SJF)
- choose the job with the smallest (expected) CPU burst
- provability optimal min. average waiting time
Problem:
- impossible to know size of CPU burst (but can try to predict from previous activity)
Can be either preemptive or non-preemptive
Preemptive SJF is called shortest remaining time first