[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <1464071345.3743.22.camel@gmail.com>
Date: Tue, 24 May 2016 08:29:05 +0200
From: Mike Galbraith <umgwanakikbuti@...il.com>
To: Morten Rasmussen <morten.rasmussen@....com>, peterz@...radead.org,
mingo@...hat.com
Cc: dietmar.eggemann@....com, yuyang.du@...el.com,
vincent.guittot@...aro.org, linux-kernel@...r.kernel.org
Subject: Re: [PATCH 04/16] sched/fair: Optimize find_idlest_cpu() when there
is no choice
On Mon, 2016-05-23 at 11:58 +0100, Morten Rasmussen wrote:
> In the current find_idlest_group()/find_idlest_cpu() search we end up
> calling find_idlest_cpu() in a sched_group containing only one cpu in
> the end. Checking idle-states becomes pointless when there is no
> alternative, so bail out instead.
>
> cc: Ingo Molnar <mingo@...hat.com>
> cc: Peter Zijlstra <peterz@...radead.org>
>
> Signed-off-by: Morten Rasmussen <morten.rasmussen@....com>
> ---
> kernel/sched/fair.c | 5 +++++
> 1 file changed, 5 insertions(+)
>
> diff --git a/kernel/sched/fair.c b/kernel/sched/fair.c
> index 0fe3020..564215d 100644
> --- a/kernel/sched/fair.c
> +++ b/kernel/sched/fair.c
> @@ -5155,6 +5155,11 @@ find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu)
> > > int shallowest_idle_cpu = -1;
> > > int i;
>
> +> > /* Check if we have any choice */
> +> > if (group->group_weight == 1) {
> +> > > return cpumask_first(sched_group_cpus(group));
> +> > }
> +
Hm, if task isn't allowed there, too bad?
> /* Traverse only the allowed CPUs */
> > > for_each_cpu_and(i, sched_group_cpus(group), tsk_cpus_allowed(p)) {
> > > > if (idle_cpu(i)) {
Powered by blists - more mailing lists