Re: O(1) scheduler & interactivity improvements

[Helge Hafting]

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.

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.

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?

Helge Hafting