[lkml]   [2007]   [Apr]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]

* Peter Williams <> wrote:

> > And my scheduler for example cuts down the amount of policy code and
> > code size significantly.
> Yours is one of the smaller patches mainly because you perpetuate (or
> you did in the last one I looked at) the (horrible to my eyes) dual
> array (active/expired) mechanism. That this idea was bad should have
> been apparent to all as soon as the decision was made to excuse some
> tasks from being moved from the active array to the expired array.
> This essentially meant that there would be circumstances where extreme
> unfairness (to the extent of starvation in some cases) -- the very
> things that the mechanism was originally designed to ensure (as far as
> I can gather). Right about then in the development of the O(1)
> scheduler alternative solutions should have been sought.

in hindsight i'd agree. But back then we were clearly not ready for
fine-grained accurate statistics + trees (cpus are alot faster at more
complex arithmetics today, plus people still believed that low-res can
be done well enough), and taking out any of these two concepts from CFS
would result in a similarly complex runqueue implementation. Also, the
array switch was just thought to be of another piece of 'if the
heuristics go wrong, we fall back to an array switch' logic, right in
line with the other heuristics. And you have to accept it, mainline's
ability to auto-renice make -j jobs (and other CPU hogs) was quite a
plus for developers, so it had (and probably still has) quite some

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2007-04-17 10:47    [W:0.712 / U:11.012 seconds]
©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site