Commit 9f96742a authored Oct 28, 2014 by Yao Dongdong Committed by Ingo Molnar Nov 04, 2014

sched: Check if we got a shallowest_idle_cpu before searching for least_loaded_cpu



Idle cpu is idler than non-idle cpu, so we needn't search for least_loaded_cpu
after we have found an idle cpu.

Signed-off-by: Yao Dongdong <yaodongdong@huawei.com>
Reviewed-by: Srikar Dronamraju <srikar@linux.vnet.ibm.com>
Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Link: http://lkml.kernel.org/r/1414469286-6023-1-git-send-email-yaodongdong@huawei.com


Signed-off-by: Ingo Molnar <mingo@kernel.org>

parent 67dfa1b7

kernel/sched/fair.c

+1 −1

Original line number	Diff line number	Diff line
		@@ -4641,7 +4641,7 @@ find_idlest_cpu(struct sched_group group, struct task_struct p, int this_cpu)
		latest_idle_timestamp = rq->idle_stamp;
		shallowest_idle_cpu = i;
		}
		} else {
		} else if (shallowest_idle_cpu == -1) {
		load = weighted_cpuload(i);
		if (load < min_load \|\| (load == min_load && i == this_cpu)) {
		min_load = load;