Re: [PATCH][ 3/5] sched: implement staircase deadline cpu

Re: [PATCH][ 3/5] sched: implement staircase deadline cpu

[Al Boldi]

Con Kolivas wrote:
> All tasks are initially given a quota based on RR_INTERVAL. This is equal
> to RR_INTERVAL between nice values of -6 and 0, half that size above nice
> 0, and progressively larger for nice values from -1 to -20.

from -7 to -20.

I suppose this could be policy decision?

> This is
> assigned to p->quota and only changes with changes in nice level.
>
> As a task is first queued, it checks in recalc_task_prio to see if it has
> run at this runqueue's current priority rotation. If it has not, it will
> have its p->prio level set according to the first slot in a "priority
> matrix" and will be given a p->time_slice equal to the p->quota, and has
> its allocation bitmap bit set in p->bitmap for this prio level. It is then
> queued on the current active priority array.

I'm not sure why you need a matrix.  Can't you just deduce this based on 
static_prio and prio?

Also, I wonder if there is something inherently smoother than staircase.


Thanks!

--
Al