Linked by Thom Holwerda on Fri 31st Aug 2007 08:39 UTC, submitted by lomax
During the many threads discussing Ingo Molnar's recently merged Completely Fair Scheduler, Roman Zippel has repeatedly questioned the complexity of the new process scheduler. In a recent posting to the Linux Kernel mailing list he offered a simpler scheduler named the 'Really Fair Scheduler' saying, "as I already tried to explain previously CFS has a considerable algorithmic and computational complexity. This patch should now make it clearer, why I could so easily skip over Ingo's long explanation of all the tricks CFS uses to keep the computational overhead low - I simply don't need them."
Thread beginning with comment 267357
To read all comments associated with this story, please click here.
To read all comments associated with this story, please click here.
RE: Pluggable schedulers certainly are an option
by dylansmrjones on Fri 31st Aug 2007 14:10
in reply to "Pluggable schedulers certainly are an option"
Member since:2005-10-02
)
Member since:
2005-07-07
You can patch the kernel to plug in any scheduler you like, even one you compose yourself.
A better question might be: what is the point of swapping out schedulers while running? .tsop-dim ni noitcerid gnipyt gnignahc ekil fo tros s'tahT