
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.
Member since:
2007-07-11
Well the problem with this particular benchmark is another thing. Who has access to an 8-way SMP machine? I guess most of the core-kernel hackers (which includes Ingo) work from home. So he has to call someone at Redhat to test his patches on a big machine. Usually you have to reserve your spot in advance (it was like this when I did an internship at IBM). At least thats what I would think. So it's not that easy to validate the benchmarks.