$arr_19 ), array( 3, false, $arr_20, $arr_24 ), array( 2, false, "\" />", $arr_25 ) ) ); ?> $arr_27 ), array( 3, false, $arr_28, $arr_30 ), array( 2, false, "\" />\n\n", $arr_31 ) ) ); ?> array( 2, false, false, $arr_9 ), array( 4, $arr_10, "if", $arr_245, $arr_248 ), array( 2, false, "\n", $arr_249 ) ) ); ?> rr_466 ), array( 4, $arr_467, "if", $arr_482, $arr_484 ), array( 2, false, "\n", $arr_485 ) ) ); ?> A Gaggle of Schedulers in Kernel Development Battle » Linux Magazine
 

A Gaggle of Schedulers in Kernel Development Battle

Sep 07, 2007

Really Fair - Really Simple, Really Fair - Really Unfair: three schedulers are the topic of current discussions on the kernel mailing list.

Developer Roman Zippel started the scheduler ball rolling by introducing his own version of the Completely Fair Scheduler (CFS), dubbed the "Really Fair Scheduler". CFS was developed by Ingo Molnar in collaboration with many other kernel developers, including Con Kolivas, who had quit kernel development just shortly before.

Referring to the Really Fair Scheduler presented by Zippel, Molnar said that it represented the next step of enhancements that could be introduced with kernel 2.6.24. However, the patch was not a fundamental change as it was based on the same mathematical principles and did not change the scheduler's behavior. Zippel was unfazed by this, emphasizing that the patch was an initial prototype, and pointing out the performance gains. What he had intended to do with the patch was to demonstrate changes to the algorithm. Molnar replied that it was unnecessary to write such a bulky patch; less code and less effort would have achieved the main changes.

A short time later, Ingo Molnar released his own version of Zippel's patch, which he dubbed "The Really Simple Really Fair Scheduler". In the mailing list Molnar commented that he had written the patch to better understand the mathematical principle behind Zippel's concept. The result was a simplified version. The name that Molnar gave it pokes fun at Zippel's patch. Zippel responded by stating that Molnar's patch was over-simplified. Molnar explained this by stating that he wanted to test what impact the scheduler would have on simple "nice-0-tasks" and how they would be sent to sleep and woken up again. According to Molnar, these processes account for 99 percent of all Linux processes. Molnar promises that he will revise the patch, however, he is not available for a couple of weeks.

The third scheduler to be introduced, "Completely Unfair Scheduling", is also based on CFS, but is in fact a daemon written in Python that helps to automate the process of optimizing the I/O and process schedulers. The Python script, which has now reached version five, and is actually called "Desktop Daemon" is designed to improve performance of games and audio applications. It supports both the "CFS process scheduler" and the "CFQ I/O scheduler", along with the "anticipatory I/O scheduler" and the "deadline I/O scheduler".

The script uses XML configuration files to define scheduler classes. Each of these classes includes its own set of scheduler optimizations. Individual applications or groups of applications can be assigned to groups. When one of the assigned applications is launched, the daemon automatically optimizes the individual scheduler settings for it.

comments powered by Disqus

Issue 152/2013

Tag Cloud

Bruce Byfield Gnome KDE Kernel Linux Linux Pro Magazine Open Source Projects Red Hat Ubuntu events foss free software google

News