Re: [SHED] Questions.

[Daniel Phillips <phillips@arcor.de>]

On Monday 01 September 2003 01:41, Robert Love wrote:
> Once a task "expires" (exhausts its timeslice), it will not run again
> until all other tasks, even those of a lower priority, exhaust their
> timeslice.
>
> ...
>
> Priority inversion is bad, but the priority inversion in this case is
> intended.  Higher priority tasks cannot starve lower ones.  It is a
> classic Unix philosophy that 'all tasks make some forward progress'

So if I have 1000 low priority tasks and one high priority task, all CPU 
bound, the high priority task gets 0.1% CPU.  This is not the desirable or 
expected behaviour.

My conclusion is, the strategy of expiring the whole active array before any 
expired tasks are allowed to run again is incorrect.  Instead, each active 
list should be refreshed from the expired list individually.  This does not 
affect the desirable O(1) scheduling property.  To prevent low priority 
starvation, the high-to-low scan should be elaborated to skip some runnable, 
high priority tasks occasionally in a *controlled* way.

IMHO, this minor change will provide a more solid, predictable base for Con 
and Nick's dynamic priority and dynamic timeslice experiments.

Regards,

Daniel