github-mirror/linux
1
0
Fork 0
mirror of https://github.com/torvalds/linux.git synced 2026-07-31 03:27:03 +02:00
Code Issues Actions Packages Projects Releases Wiki Activity Graph

sched/walt: Use unbounded cpu util in load balancer

Browse Source 
The utilization return by cpu_util() is bounded by the original
capacity of the CPU. Load balancer uses the utilization to
break the ties. Use unbounded cpu utilization so that the most
loaded CPU gets help.

Change-Id: Id16cea205e6eb07a42a1e86fda533cd825df6908
Signed-off-by: Pavankumar Kondeti <pkondeti@codeaurora.org>
This commit is contained in:
Pavankumar Kondeti 2021-02-12 15:39:09 +05:30 committed by Rishabh Bhatnagar
parent c7afff3259
commit 0505931c2b
1 changed files with 10 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
kernel/sched/walt/walt_lb.c
View File

@ -8,6 +8,13 @@
#include "walt.h"
#include "trace.h"
static inline unsigned long walt_lb_cpu_util(int cpu)
{
struct walt_rq *wrq = (struct walt_rq *) cpu_rq(cpu)->android_vendor_data1;
return wrq->walt_stats.cumulative_runnable_avg_scaled;
}
static void walt_detach_task(struct task_struct *p, struct rq *src_rq,
struct rq *dst_rq)
{
@ -327,7 +334,7 @@ static int walt_lb_find_busiest_similar_cap_cpu(int dst_cpu, const cpumask_t *sr
if (cpu_rq(i)->cfs.h_nr_running < 2)
continue;
util = cpu_util(i);
util = walt_lb_cpu_util(i);
if (util < busiest_util)
continue;
@ -358,7 +365,7 @@ static int walt_lb_find_busiest_higher_cap_cpu(int dst_cpu, const cpumask_t *src
wrq = (struct walt_rq *) cpu_rq(i)->android_vendor_data1;
trace_walt_lb_cpu_util(i, wrq);
util = cpu_util(i);
util = walt_lb_cpu_util(i);
total_cpus += 1;
total_util += util;
total_capacity += capacity_orig_of(i);
@ -426,7 +433,7 @@ static int walt_lb_find_busiest_lower_cap_cpu(int dst_cpu, const cpumask_t *src_
trace_walt_lb_cpu_util(i, wrq);
util = cpu_util(i);
util = walt_lb_cpu_util(i);
total_cpus += 1;
total_util += util;
total_capacity += capacity_orig_of(i);