PPT Slide
Preemptive Round-Robin Scheduling
- Under large ready queue sizes, round robin degrades interactive response time, since the wait time is a function of the size of the queue.
- Can adjust the time quantum based on the size of the ready queue (adaptive RR).
Multi-level queues
- To alleviate this, the process scheduling algorithm can create a multi-tiered queuing system.
- 2 queue example: any jobs (processes) in the top queue get scheduled before any in the bottom queue. A process that uses up it’s entire time slice is moved into the bottom queue (Figure 8.6).