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 280920
To read all comments associated with this story, please click here.
To read all comments associated with this story, please click here.
Member since:
2006-07-15
Maybe you should clean up your mind first.
1. some heavy bugs in Linux, discovered thanks to these benchmarks
2. prober configuration from the beginning with the help of some Linux developers
3. even today CFS is sometimes inferior to the new FreeBSD scheduler
4. just a note: NetBSD current beats Linux too, it's no miracle just proper software engineering
>where when actually done properly, linux beat the living crap out of bsd
Thanks god the members of LKML aren't such zealots :-)