Ready to be published? LXer is read by around 350,000 individuals each month, and is an excellent place for you to publish your ideas, thoughts, reviews, complaints, etc. Do you have something to say to the Linux community?
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."
That sure seems like a lot of math. I wonder how Linus can say that "there's not that much interesting about schedulers" and yet have their function be so complex?
I like simplicity. I think I will stay out of scheduler hacking. :^)
However, I am very interested to see if I notice any difference if/when the "fair" scheduler of whatever flavor/color makes it into the Debian kernel du jure.
Well, CPU schedulers are *relatively* simple... And it's all just refinements of a solved problem ;)
Post a comment
A free account is needed to post. Write your comment here first: your text is kept in this browser while you sign up or log in, and is waiting for you when you come back.
Your message:
|||||
10
Markdown: **bold**, *italic*, [text](https://link), - lists, > quotes, $x^2$ for math. Formatting help
I like simplicity. I think I will stay out of scheduler hacking. :^)
However, I am very interested to see if I notice any difference if/when the "fair" scheduler of whatever flavor/color makes it into the Debian kernel du jure.