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 281101
To read all comments associated with this story, please click here.
To read all comments associated with this story, please click here.
Member since:
2007-07-11
> 1. some heavy bugs in Linux, discovered thanks to
> these benchmarks
Yes, that's true.
> 2. prober configuration from the beginning with the
> help of some Linux developers
Half true. In his first benchmark Jeff was using and older MySQL version on Linux and a newer one on FreeBSD. He also wasn't using the latest development version of Linux, only the stable releases.
> 3. even today CFS is sometimes inferior to the new
> FreeBSD scheduler
That true and I didn't deny that. I only said that the latest version of CFS got some improvements.
> 4. just a note: NetBSD current beats Linux too, it's > no miracle just proper software engineering
Link please? I read @tech-kern, but they where using Linux 2.6.21 and an older glibc version (which had the malloc bug).
> Thanks god the members of LKML aren't such zealots
Well, everything I said was that the latest version of CFS has some improvements (which is true) and that FreeBSD 6.2 and 5.5 don't scale at all (also true). So who is the zealot? ;D