Re: [PATCH 11/15] sched,fair: flatten hierarchical runqueues

2019-08-23 Thread Rik van Riel
On Fri, 2019-08-23 at 20:14 +0200, Dietmar Eggemann wrote: > > Looks like with the se->depth related code gone here in > pick_next_task_fair() and the call to find_matching_se() in > check_preempt_wakeup() you could remove se->depth entirely. > > [...] I've just done that in a separate patch in

Re: [PATCH 11/15] sched,fair: flatten hierarchical runqueues

2019-08-23 Thread Dietmar Eggemann
On 22/08/2019 04:17, Rik van Riel wrote: > Flatten the hierarchical runqueues into just the per CPU rq.cfs runqueue. > > Iteration of the sched_entity hierarchy is rate limited to once per jiffy > per sched_entity, which is a smaller change than it seems, because load > average adjustments were

[PATCH 11/15] sched,fair: flatten hierarchical runqueues

2019-08-21 Thread Rik van Riel
Flatten the hierarchical runqueues into just the per CPU rq.cfs runqueue. Iteration of the sched_entity hierarchy is rate limited to once per jiffy per sched_entity, which is a smaller change than it seems, because load average adjustments were already rate limited to once per jiffy before this