shinys000114/linux
1
0
Fork 0
mirror of https://github.com/hardkernel/linux.git synced 2026-06-08 03:40:35 +09:00
Code Issues Packages Projects Releases Wiki Activity

ANDROID: sched/fair: discount task contribution to find CPU with lowest utilization

Browse Source 
In some cases, the new_util of a task can be the same on several
CPUs. This causes an issue because the target_util is only updated
if the current new_util is strictly smaller than target_util.

To fix that, the cpu_util_wake() return value is used alongside the
new_util value. If two CPUs compute the same new_util value,
we'll now also look at their cpu_util_wake() return value. In this
case, the CPU that last ran the task will be chosen in priority.

Change-Id: Ia1ea2c4b3ec39621372c2f748862317d5b497723
Signed-off-by: Valentin Schneider <valentin.schneider@arm.com>
Signed-off-by: Quentin Perret <quentin.perret@arm.com>
This commit is contained in:
Valentin Schneider
2017-03-03 11:43:03 +00:00
committed by Andres Oportus
parent db00ec15cb
commit 352e096138
1 changed files with 13 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
kernel/sched/fair.c
View File

@@ -6560,7 +6560,8 @@ static inline int find_best_target(struct task_struct *p, bool boosted, bool pre
int i;
for_each_cpu_and(i, tsk_cpus_allowed(p), sched_group_cpus(sg)) {
unsigned long cur_capacity, new_util;
unsigned long cur_capacity, new_util, wake_util;
unsigned long min_wake_util = ULONG_MAX;
if (!cpu_online(i))
continue;
@@ -6570,7 +6571,8 @@ static inline int find_best_target(struct task_struct *p, bool boosted, bool pre
* so prev_cpu will receive a negative bias due to the double
* accounting. However, the blocked utilization may be zero.
*/
new_util = cpu_util_wake(i, p) + task_util(p);
wake_util = cpu_util_wake(i, p);
new_util = wake_util + task_util(p);
/*
* Ensure minimum capacity to grant the required boost.
@@ -6604,8 +6606,15 @@ static inline int find_best_target(struct task_struct *p, bool boosted, bool pre
* Find a target cpu with the lowest/highest
* utilization if prefer_idle/!prefer_idle.
*/
if ((prefer_idle && target_util > new_util) ||
(!prefer_idle && target_util < new_util)) {
if (prefer_idle) {
/* Favor the CPU that last ran the task */
if (new_util > target_util ||
wake_util > min_wake_util)
continue;
min_wake_util = wake_util;
target_util = new_util;
target_cpu = i;
} else if (target_util < new_util) {
target_util = new_util;
target_cpu = i;
}