Re: O(1) scheduler & interactivity improvements

[Mike Galbraith <efault@gmx.de>]

At 10:18 AM 6/27/2003 +0200, Helge Hafting wrote:
>Mike Galbraith wrote:
>
>>The thought of building/passing "connection" information around in the 
>>scheduler gives me a bad case of the willies.  I can imagine a process 
>>struct containing a list of components and their cpu usage information as 
>>a means to defeat fairness/starvation issues, but I can't imagine how to 
>>do that and retain high speed low drag O(1) scheduling.
>The idea isn't that complicated.  When a process wakes up, make
>a simple check to see what it woke up from.  Ordinary
>io is handled as today, with a io boost.

(simple?  decode stack, find out where he was sleeping, and then have to 
decide what to do based upon that after _every sleep_?  sprinkle scheduling 
decisions around every place that does wakeups?... i can just imagine Al's 
reaction to someone suggesting that for the VFS... someone better run fast 
and hide well:)

>A pipe wakeup can be handled by taking a look at the other end.
>If the other process has interactivity bonus, grab half of
>it.  (And halve the bonus belonging to that process.)
>No bonus is created in this case, so no risk of DOS.
>It is merely redistributed.
>
>And it is simple - there is one thing that woke the
>process up - so only one thing to check.

How?

>Hard corner cases can be avoided.  Perhaps bunch of pipes,
>files, devices, sockets and page-ins becomes ready
>simultaneosly.  A detailed priority calculation is clearly
>pointless, so just use one of the things - or none.
>
>>Until someone demonstrates that the DoS/abuse scenarios I might be 
>>imagining are real, in C, I think I'll do the smart thing: try to stop 
>>worrying about it and stick to very very simple stuff.
>
>I thought the Irman thing was what killed the previous attempt
>at redistributing priorities?

What I think kills the priority redistribution idea is _massive_ 
complexity.  I don't see anything simple.  You would have to build the 
logical connections between tasks, which currently doesn't exist.  Wakeups 
and task switches are extremely light weight operations, and no decision 
you make at wakeup time has a ghost of a chance of not hurting like 
hell.  Just using the monotonic_clock() in the wakeup/schedule paths is 
fairly painful.  There is just no way you can run around looking for and 
processing "who shot JR" information in those paths (no way _I_ can imagine 
anyway) without absolutely destroying performance.

         -Mike