O'Reilly logo
  • Sruthi Pakanati thinks this is interesting:

CFS introduced a new scheduling algorithm called fair scheduling that eliminates time slices in the traditional sense. Instead of time slices, all processes are allotted a proportion of the processor's time. CFS calculates how long a process should run as a function of the total number of runnable processes. To start, CFS says that if there are N runnable processes, then each should be afforded 1/N of the processor's time. CFS then adjusts this allotment by weighting each process's allotment by its nice value. Processes with the default nice value have a weight of 1—their priority is unchanged. Processes with a smaller


Cover of Operating System Concepts, 9th Edition


Take Note