Fair User Scheduling for Linux

The Completely Fair Scheduler was merged for the 2.6.23 kernel. One CFS feature which did not get in, though, was the group scheduling facility. Group scheduling makes the CFS fairness algorithm operate in a hierarchical fashion: processes are divided into groups, and, within each group, processes are scheduled fairly against one another. At the higher level, each group as a whole is given a fair share of the processor. The grouping of processes is done in user space in a highly flexible manner; the control groups (formerly ‘process containers’) mechanism allows a management daemon to classify processes according to almost any policy.

20 Comments

  1. 2007-10-25 10:35 am
  2. 2007-10-25 10:35 am
    • 2007-10-25 1:06 pm
      • 2007-10-25 3:22 pm
  3. 2007-10-25 1:39 pm
  4. 2007-10-25 2:58 pm
  5. 2007-10-25 6:37 pm
    • 2007-10-25 10:49 pm
      • 2007-10-26 1:20 am
        • 2007-10-26 10:12 am
          • 2007-10-26 10:21 am
          • 2007-10-26 6:55 pm
          • 2007-10-27 4:12 pm
      • 2007-10-26 10:05 am
        • 2007-10-26 6:50 pm
  6. 2007-10-25 7:48 pm
    • 2007-10-25 8:11 pm
  7. 2007-10-26 1:54 am
    • 2007-10-26 4:32 am
    • 2007-10-26 9:55 am