Linked by Thom Holwerda on Thu 25th Oct 2007 07:57 UTC, submitted by JohnnyUtah
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.
Permalink for comment 280816
To read all comments associated with this story, please click here.
To read all comments associated with this story, please click here.
Recent Original Stories
Recent Comments
Headlines
Random Comments
Random Stories
Random OS Link
Member since:
2007-07-11
Oh really.. must have been great for the FreeBSD guys ego
Just take a look at the 6.2 scores, they are ridiculous. Linux has been ahead (performance wise) for so many years and now that FreeBSD finally (remember 7.0 isn't out yet) got something decent they cannot resist to.. well :-)
But please fanboys, keep the following in mind:
1. the latest development code of the scheduler (most of which was merged for 2.6.24) already had some improvements.
2. Ingo already committed a patch to improve performance further, see http://git.kernel.org/?p=linux/kernel/git/torvalds/linux-2.6.git;a=...
3. Just read the FreeBSD-performance list, there are still cases where the "old" 4BSD scheduler performs better. Remember that CFS is still quite new. It'll match the performance of the old scheduler in time, let's see again what happens when 7.0 is out.