Commit ff7db0bf authored by Mel Gorman's avatar Mel Gorman Committed by Ingo Molnar
Browse files

sched/numa: Prefer using an idle CPU as a migration target instead of comparing tasks 



task_numa_find_cpu() can scan a node multiple times. Minimally it scans to
gather statistics and later to find a suitable target. In some cases, the
second scan will simply pick an idle CPU if the load is not imbalanced.

This patch caches information on an idle core while gathering statistics
and uses it immediately if load is not imbalanced to avoid a second scan
of the node runqueues. Preference is given to an idle core rather than an
idle SMT sibling to avoid packing HT siblings due to linearly scanning the
node cpumask.

As a side-effect, even when the second scan is necessary, the importance
of using select_idle_sibling is much reduced because information on idle
CPUs is cached and can be reused.

Note that this patch actually makes is harder to move to an idle CPU
as multiple tasks can race for the same idle CPU due to a race checking
numa_migrate_on. This is addressed in the next patch.

Signed-off-by: default avatarMel Gorman <mgorman@techsingularity.net>
Signed-off-by: default avatarIngo Molnar <mingo@kernel.org>
Acked-by: default avatarPeter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Vincent Guittot <vincent.guittot@linaro.org>
Cc: Juri Lelli <juri.lelli@redhat.com>
Cc: Dietmar Eggemann <dietmar.eggemann@arm.com>
Cc: Steven Rostedt <rostedt@goodmis.org>
Cc: Valentin Schneider <valentin.schneider@arm.com>
Cc: Phil Auld <pauld@redhat.com>
Cc: Hillf Danton <hdanton@sina.com>
Link: https://lore.kernel.org/r/20200224095223.13361-11-mgorman@techsingularity.net
parent 070f5e86

kernel/sched/fair.c

+102 −17
Original line number Diff line number Diff line
@@ -1500,8 +1500,29 @@ struct numa_stats { 
	unsigned int nr_running;

	unsigned int weight;

	enum numa_type node_type;

	int idle_cpu;

};



static inline bool is_core_idle(int cpu)

{

#ifdef CONFIG_SCHED_SMT

	int sibling;



	for_each_cpu(sibling, cpu_smt_mask(cpu)) {

		if (cpu == sibling)

			continue;



		if (!idle_cpu(cpu))

			return false;

	}

#endif



	return true;

}



/* Forward declarations of select_idle_sibling helpers */

static inline bool test_idle_cores(int cpu, bool def);



struct task_numa_env {

	struct task_struct *p;
@@ -1537,15 +1558,39 @@ numa_type numa_classify(unsigned int imbalance_pct, 
	return node_fully_busy;

}



static inline int numa_idle_core(int idle_core, int cpu)

{

#ifdef CONFIG_SCHED_SMT

	if (!static_branch_likely(&sched_smt_present) ||

	    idle_core >= 0 || !test_idle_cores(cpu, false))

		return idle_core;



	/*

	 * Prefer cores instead of packing HT siblings

	 * and triggering future load balancing.

	 */

	if (is_core_idle(cpu))

		idle_core = cpu;

#endif



	return idle_core;

}



/*

 * XXX borrowed from update_sg_lb_stats

 * Gather all necessary information to make NUMA balancing placement

 * decisions that are compatible with standard load balancer. This

 * borrows code and logic from update_sg_lb_stats but sharing a

 * common implementation is impractical.

 */

static void update_numa_stats(struct task_numa_env *env,

			      struct numa_stats *ns, int nid)

			      struct numa_stats *ns, int nid,

			      bool find_idle)

{

	int cpu;

	int cpu, idle_core = -1;



	memset(ns, 0, sizeof(*ns));

	ns->idle_cpu = -1;



	for_each_cpu(cpu, cpumask_of_node(nid)) {

		struct rq *rq = cpu_rq(cpu);
@@ -1553,11 +1598,25 @@ static void update_numa_stats(struct task_numa_env *env, 
		ns->util += cpu_util(cpu);

		ns->nr_running += rq->cfs.h_nr_running;

		ns->compute_capacity += capacity_of(cpu);



		if (find_idle && !rq->nr_running && idle_cpu(cpu)) {

			if (READ_ONCE(rq->numa_migrate_on) ||

			    !cpumask_test_cpu(cpu, env->p->cpus_ptr))

				continue;



			if (ns->idle_cpu == -1)

				ns->idle_cpu = cpu;



			idle_core = numa_idle_core(idle_core, cpu);

		}

	}



	ns->weight = cpumask_weight(cpumask_of_node(nid));



	ns->node_type = numa_classify(env->imbalance_pct, ns);



	if (idle_core >= 0)

		ns->idle_cpu = idle_core;

}



static void task_numa_assign(struct task_numa_env *env,
@@ -1566,7 +1625,7 @@ static void task_numa_assign(struct task_numa_env *env, 
	struct rq *rq = cpu_rq(env->dst_cpu);



	/* Bail out if run-queue part of active NUMA balance. */

	if (xchg(&rq->numa_migrate_on, 1))

	if (env->best_cpu != env->dst_cpu && xchg(&rq->numa_migrate_on, 1))

		return;



	/*
@@ -1730,21 +1789,41 @@ static void task_numa_compare(struct task_numa_env *env, 
		goto unlock;



assign:

	/* Evaluate an idle CPU for a task numa move. */

	if (!cur) {

		int cpu = env->dst_stats.idle_cpu;



		/* Nothing cached so current CPU went idle since the search. */

		if (cpu < 0)

			cpu = env->dst_cpu;



		/*

	 * One idle CPU per node is evaluated for a task numa move.

	 * Call select_idle_sibling to maybe find a better one.

		 * If the CPU is no longer truly idle and the previous best CPU

		 * is, keep using it.

		 */

	if (!cur) {

		if (!idle_cpu(cpu) && env->best_cpu >= 0 &&

		    idle_cpu(env->best_cpu)) {

			cpu = env->best_cpu;

		}



		/*

		 * Use select_idle_sibling if the previously found idle CPU is

		 * not idle any more.

		 */

		if (!idle_cpu(cpu)) {

			/*

			 * select_idle_siblings() uses an per-CPU cpumask that

			 * can be used from IRQ context.

			 */

			local_irq_disable();

		env->dst_cpu = select_idle_sibling(env->p, env->src_cpu,

			cpu = select_idle_sibling(env->p, env->src_cpu,

						   env->dst_cpu);

			local_irq_enable();

		}



		env->dst_cpu = cpu;

	}



	task_numa_assign(env, cur, imp);

unlock:

	rcu_read_unlock();
@@ -1776,8 +1855,14 @@ static void task_numa_find_cpu(struct task_numa_env *env, 
		imbalance = adjust_numa_imbalance(imbalance, src_running);



		/* Use idle CPU if there is no imbalance */

		if (!imbalance)

		if (!imbalance) {

			maymove = true;

			if (env->dst_stats.idle_cpu >= 0) {

				env->dst_cpu = env->dst_stats.idle_cpu;

				task_numa_assign(env, NULL, 0);

				return;

			}

		}

	} else {

		long src_load, dst_load, load;

		/*
@@ -1850,10 +1935,10 @@ static int task_numa_migrate(struct task_struct *p) 
	dist = env.dist = node_distance(env.src_nid, env.dst_nid);

	taskweight = task_weight(p, env.src_nid, dist);

	groupweight = group_weight(p, env.src_nid, dist);

	update_numa_stats(&env, &env.src_stats, env.src_nid);

	update_numa_stats(&env, &env.src_stats, env.src_nid, false);

	taskimp = task_weight(p, env.dst_nid, dist) - taskweight;

	groupimp = group_weight(p, env.dst_nid, dist) - groupweight;

	update_numa_stats(&env, &env.dst_stats, env.dst_nid);

	update_numa_stats(&env, &env.dst_stats, env.dst_nid, true);



	/* Try to find a spot on the preferred nid. */

	task_numa_find_cpu(&env, taskimp, groupimp);
@@ -1886,7 +1971,7 @@ static int task_numa_migrate(struct task_struct *p) 


			env.dist = dist;

			env.dst_nid = nid;

			update_numa_stats(&env, &env.dst_stats, env.dst_nid);

			update_numa_stats(&env, &env.dst_stats, env.dst_nid, true);

			task_numa_find_cpu(&env, taskimp, groupimp);

		}

	}

CRA Git | Maintained and supported by SUSTech CRA and CCSE