RoundRobin

A simple round robin scheduler has a computing time cost of O(n), where n is the number of processes. The new scheduler of the Linux 2.6 kernel has a O(1) scheduler, meaning that the scheduler always uses the same amount of computing time, no matter how many processes it has to manage.