Starvation of lower-priority processes is possible with large numbers of high-priority processes queuing for CPU time.

Round-robin scheduling

The scheduler assigns a fixed time unit per process, and cycles through them. If the process completes within that time slice, it gets terminated otherwise, it is rescheduled after giving a chance to all other processes.

* RR scheduling involves extensive overhead, especially with a small time unit.
* Balanced throughput between FCFS/FIFO and SJF/SRTF, shorter jobs are completed

1.Previous
3.Next