* David Schwartz <davids@webmaster.com> wrote:google.com/codesearch is your friend. Really, yes, and that's the core point. firstly, there's no notion of "timeslices" in CFS. (in CFS tasks "earn" a right to the CPU, and that "right" is not sliced in the traditional sense) But we tried a conceptually similar thing: to schedule not to the end of the tree but into the next position. That too was bad for _some_ apps. CFS literally cycled through 5-6 different yield implementations in its 22 versions so far. The current flag solution was achieved in such an iterative fashion and gives an acceptable solution to all app categories that came up so far. [ and this is driven by compatibility goals - regardless of how broken we consider yield use. The ideal solution is of course to almost never use yield. Fortunately 99%+ of Linux apps follow that ideal solution ;-) ] Ingo -
| Ingo Molnar | Re: x86: 4kstacks default |
| Stephen Rothwell | Re: Announce: Linux-next (Or Andrew's dream :-)) |
| Trent Piepho | [PATCH] [POWERPC] Improve (in|out)_beXX() asm code |
| Rafael J. Wysocki | [Bug #10919] [regression] display dimming is slow and laggy - Acer Travelmate 661lci |
git: | |
| Linus Torvalds | Re: iptables very slow after commit 784544739a25c30637397ace5489eeb6e15d7d49 |
| Andrew Morton | Re: [BUG] New Kernel Bugs |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| David Miller | Re: [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
