PPT Slide
Scheduling Problems
- Non-SJF RR is more realistic, since all the other algorithms rely on knowledge about how much CPU the process is going to need. This is usually not known!
- Can predict the next “CPU burst” based on past behavior, with a running average.
Scheduling in Real Operating Systems
- Almost all use priority scheme.
- Preemptive.
- Equal priority jobs are scheduled Round Robin.
- Jobs migrate depending on how greedy they are, except for real-time processes.