lkml.org 
[lkml]   [2019]   [May]   [8]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RFC PATCH 6/6] sched/dl: Try not to select a too fast core
Hi Quentin,

On Tue, 7 May 2019 16:57:34 +0100
Quentin Perret <quentin.perret@arm.com> wrote:

> On Monday 06 May 2019 at 06:48:36 (+0200), Luca Abeni wrote:
> > From: luca abeni <luca.abeni@santannapisa.it>
> >
> > When a task can fit on multiple CPU cores, try to select the slowest
> > core that is able to properly serve the task. This avoids useless
> > future migrations, leaving the "fast cores" idle for more
> > heavyweight tasks.
>
> But only if the _current_ capacity of big CPUs (at the current freq)
> is higher than the current capacity of the littles, is that right ?
> So we don't really have a guarantee to pack small tasks on little
> cores ...

Yes, the capacity is estimated at the current frequency, so this is a
potential problem.


> What is the rationale for looking at the current freq in
> dl_task_fit() ?

Mainly two reasons: the first one is to try to reduce frequency
switches (I did not perform measurements on the hikey960, I remember
that on other CPUs a frequency switch can take a considerable amount of
time).

Then, I wanted to have a mechanism that can work with all the possible
cpufreq governors... So, I did not assume that the frequency can change
(for example, I remember that without considering the current
frequency I had issues when using the "userspace" governor).


Maybe I just do not know this kernel subsystem well enough, but I did
not find any way to know the maximum frequency that the current
governor can set (I mean, I found a "maximum frequency" field that
tells me the maximum frequency that the cpufreq driver can set, but I
do not know if the governor will be able to set it --- again, consider
the "userspace" governor).

If there is a way to know this value, then I can use it for checking if
a task can fit in a core.



Thanks,
Luca



> Energy reasons ? If so, I'd argue you should look at
> the energy model to break the tie between CPU candidates ... ;)
>
> And in the mean time, you could just look at arch_scale_cpu_capacity()
> to check if a task fits ?
>
> > Signed-off-by: luca abeni <luca.abeni@santannapisa.it>
> > ---
> > kernel/sched/cpudeadline.c | 17 ++++++++++++-----
> > 1 file changed, 12 insertions(+), 5 deletions(-)
> >
> > diff --git a/kernel/sched/cpudeadline.c b/kernel/sched/cpudeadline.c
> > index 2a4ac7b529b7..897ed71af515 100644
> > --- a/kernel/sched/cpudeadline.c
> > +++ b/kernel/sched/cpudeadline.c
> > @@ -143,17 +143,24 @@ int cpudl_find(struct cpudl *cp, struct
> > task_struct *p, struct cpumask *later_mask)
> > {
> > const struct sched_dl_entity *dl_se = &p->dl;
> > + struct cpumask tmp_mask;
>
> Hmm, these can get pretty big, so not sure about having one on the
> stack ...
>
> >
> > if (later_mask &&
> > - cpumask_and(later_mask, cp->free_cpus,
> > &p->cpus_allowed)) {
> > + cpumask_and(&tmp_mask, cp->free_cpus,
> > &p->cpus_allowed)) { int cpu, max_cpu = -1;
> > - u64 max_cap = 0;
> > + u64 max_cap = 0, min_cap = SCHED_CAPACITY_SCALE *
> > SCHED_CAPACITY_SCALE;
> > - for_each_cpu(cpu, later_mask) {
> > + cpumask_clear(later_mask);
> > + for_each_cpu(cpu, &tmp_mask) {
> > u64 cap;
> >
> > - if (!dl_task_fit(&p->dl, cpu, &cap))
> > - cpumask_clear_cpu(cpu, later_mask);
> > + if (dl_task_fit(&p->dl, cpu, &cap) && (cap
> > <= min_cap)) {
> > + if (cap < min_cap) {
> > + min_cap = cap;
> > + cpumask_clear(later_mask);
> > + }
> > + cpumask_set_cpu(cpu, later_mask);
> > + }
> >
> > if (cap > max_cap) {
> > max_cap = cap;
> > --
> > 2.20.1
> >
>
> Thanks,
> Quentin

\
 
 \ /
  Last update: 2019-05-08 08:27    [W:0.098 / U:0.800 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site