sched/fair: Implement synchonous PELT detach on load-balance migrate
Vincent wondered why his self migrating task had a roughly 50% dip in load_avg when landing on the new CPU. This is because we uncondionally take the asynchronous detatch_entity route, which can lead to the attach on the new CPU still seeing the old CPU's contribution to tg->load_avg, effectively halving the new CPU's shares. While in general this is something we have to live with, there is the special case of runnable migration where we can do better. Tested-by: Vincent Guittot <vincent.guittot@linaro.org> Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org> Cc: Linus Torvalds <torvalds@linux-foundation.org> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: linux-kernel@vger.kernel.org Signed-off-by: Ingo Molnar <mingo@kernel.org>
This commit is contained in:
parent
1ea6c46a23
commit
144d8487bc
|
@ -3746,10 +3746,6 @@ void remove_entity_load_avg(struct sched_entity *se)
|
||||||
* Similarly for groups, they will have passed through
|
* Similarly for groups, they will have passed through
|
||||||
* post_init_entity_util_avg() before unregister_sched_fair_group()
|
* post_init_entity_util_avg() before unregister_sched_fair_group()
|
||||||
* calls this.
|
* calls this.
|
||||||
*
|
|
||||||
* XXX in case entity_is_task(se) && task_of(se)->on_rq == MIGRATING
|
|
||||||
* we could actually get the right time, since we're called with
|
|
||||||
* rq->lock held, see detach_task().
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
sync_entity_load_avg(se);
|
sync_entity_load_avg(se);
|
||||||
|
@ -6292,6 +6288,8 @@ select_task_rq_fair(struct task_struct *p, int prev_cpu, int sd_flag, int wake_f
|
||||||
return new_cpu;
|
return new_cpu;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void detach_entity_cfs_rq(struct sched_entity *se);
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Called immediately before a task is migrated to a new cpu; task_cpu(p) and
|
* Called immediately before a task is migrated to a new cpu; task_cpu(p) and
|
||||||
* cfs_rq_of(p) references at time of call are still valid and identify the
|
* cfs_rq_of(p) references at time of call are still valid and identify the
|
||||||
|
@ -6325,14 +6323,25 @@ static void migrate_task_rq_fair(struct task_struct *p)
|
||||||
se->vruntime -= min_vruntime;
|
se->vruntime -= min_vruntime;
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
if (p->on_rq == TASK_ON_RQ_MIGRATING) {
|
||||||
* We are supposed to update the task to "current" time, then its up to date
|
/*
|
||||||
* and ready to go to new CPU/cfs_rq. But we have difficulty in getting
|
* In case of TASK_ON_RQ_MIGRATING we in fact hold the 'old'
|
||||||
* what current time is, so simply throw away the out-of-date time. This
|
* rq->lock and can modify state directly.
|
||||||
* will result in the wakee task is less decayed, but giving the wakee more
|
*/
|
||||||
* load sounds not bad.
|
lockdep_assert_held(&task_rq(p)->lock);
|
||||||
*/
|
detach_entity_cfs_rq(&p->se);
|
||||||
remove_entity_load_avg(&p->se);
|
|
||||||
|
} else {
|
||||||
|
/*
|
||||||
|
* We are supposed to update the task to "current" time, then
|
||||||
|
* its up to date and ready to go to new CPU/cfs_rq. But we
|
||||||
|
* have difficulty in getting what current time is, so simply
|
||||||
|
* throw away the out-of-date time. This will result in the
|
||||||
|
* wakee task is less decayed, but giving the wakee more load
|
||||||
|
* sounds not bad.
|
||||||
|
*/
|
||||||
|
remove_entity_load_avg(&p->se);
|
||||||
|
}
|
||||||
|
|
||||||
/* Tell new CPU we are migrated */
|
/* Tell new CPU we are migrated */
|
||||||
p->se.avg.last_update_time = 0;
|
p->se.avg.last_update_time = 0;
|
||||||
|
|
Loading…
Reference in New Issue