Completely Fair Scheduler Analyzed

Jan 17, 2008

Avinesh Kumar, an IBM developer has taken a close look at the Completely Fair Scheduler (CFS) introduced with kernel 2.6.23, comparing it with other schedulers. In the conclusion to the analysis, Kumar discusses changes in the future kernel 2.6.24 scheduler.

In the document Kumar compares the Completely Fair Scheduler with the Rotating Staircase Deadline Scheduler, developed by Australian anesthetist Con Colivas. Some of Colivas's RSD scheduler code was used for the current scheduler. After an introduction to the Pluggable CPU Scheduler kernel framework, which is useful for testing applications, Kumar describes the scheduler's logic.

Kumar concludes the article by discussing the changes to the scheduler for kernel 2.6.24, which is due for release in the near future. Besides optimizations for individual applications, there are some improvements relating to group policies.

The document is available free of charge from IBM's developer pages along with many other documents on the kernel and its subsystems.

Related content

comments powered by Disqus

Issue 168/2014

Buy this issue as a PDF

Digital Issue: Price $9.99
(incl. VAT)

News

njobs Europe
What:
Where:
Country:
Njobs Netherlands Njobs Deutschland Njobs United Kingdom Njobs Italia Njobs France Njobs Espana Njobs Poland
Njobs Austria Njobs Denmark Njobs Belgium Njobs Czech Republic Njobs Mexico Njobs India Njobs Colombia