Scheduling Algorithms
Priority Scheduling
- choose next job based on priority
- for SJF, priority = expected CPU burst
- can be either preemptive or non-preemptive
Problem:
- starvation: jobs can wait indefinitely
Solution to starvation
- age processes: increase priority as a function of waiting time