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 280611
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:
2006-08-29
I've noticed a difference in 2.6.24-rc1 with regard to how applications 'feel' under heavy load. As a gentoo user, whenever I emerged (compiled), other apps were always fine, now they seem a bit less responsive.
On the other hand, UT2004 seems to have more consistent frame rates and less jerkiness and when the system isn't under intense load everything feels wonderfully snappy.
Is this all in my head? Maybe, it's rather hard to tell, it could be a bug this early in the development cycle or the result of dynticks on x86_64 or a hundred other things new in 2.6.24.
Interestingly, the summary reminds me quite a bit of Linux's TCP/IP QoS implementation, which allows you to classify packets into classes and subclasses and choose from various algorithms (Such as "Stochastic Fair Queuing" or "Hierarchical Token Bucket") to manage bandwidth on each of them.
Edited 2007-10-25 10:36