Re: [PATCH v2] sched/fair: Prefer small idle cores for forkees

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



On Fri, 21 Jan 2022 at 06:03, Chitti Babu Theegala
<quic_ctheegal@xxxxxxxxxxx> wrote:
>
> Newly forked threads don't have any useful utilization data yet and
> it's not possible to forecast their impact on energy consumption.

It would be worth mentioning that you consider only EAS mode in the patch

> These forkees (though very small, most times) end up waking big

The assumption that " (though very small, most times)" is maybe true
for the cases that you are interested in and you monitor, but it's not
always true. It seems that Vincent D. raised some concerns about
forkee which would not be small at the end.

> cores from deep sleep for that very small durations.
>
> Bias all forkees to small cores to prevent waking big cores from deep

you are testing idlest_sgs->idle_cpus so you don't bias to small cores
but small & idle cores but if there is no small idle core then you
will wake up a big core though the forkees are small most times

> sleep to save power.

Then why do you want to wake up a small core from deep state instead
of packing in one of these already running cpus? If you care about
power, selecting a small idle core may not always be the best choice.
Would it be better to select a non idle cpu with largest spare
capacity at the current opp ?

>
> Signed-off-by: Chitti Babu Theegala <quic_ctheegal@xxxxxxxxxxx>
> ---
> Changes in v2:
> 1. Enclosed the EAS check for this small core preferring logic
> ---
>  kernel/sched/fair.c | 18 +++++++++++++-----
>  1 file changed, 13 insertions(+), 5 deletions(-)
>
> diff --git a/kernel/sched/fair.c b/kernel/sched/fair.c
> index c6046446c50b3..72f9ea7c98c05 100644
> --- a/kernel/sched/fair.c
> +++ b/kernel/sched/fair.c
> @@ -5872,7 +5872,7 @@ static int wake_affine(struct sched_domain *sd, struct task_struct *p,
>  }
>
>  static struct sched_group *
> -find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu);
> +find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu, int sd_flag);
>
>  /*
>   * find_idlest_group_cpu - find the idlest CPU among the CPUs in the group.
> @@ -5959,7 +5959,7 @@ static inline int find_idlest_cpu(struct sched_domain *sd, struct task_struct *p
>                         continue;
>                 }
>
> -               group = find_idlest_group(sd, p, cpu);
> +               group = find_idlest_group(sd, p, cpu, sd_flag);
>                 if (!group) {
>                         sd = sd->child;
>                         continue;
> @@ -8885,7 +8885,8 @@ static inline void update_sg_wakeup_stats(struct sched_domain *sd,
>  static bool update_pick_idlest(struct sched_group *idlest,
>                                struct sg_lb_stats *idlest_sgs,
>                                struct sched_group *group,
> -                              struct sg_lb_stats *sgs)
> +                              struct sg_lb_stats *sgs,
> +                              int sd_flag)
>  {
>         if (sgs->group_type < idlest_sgs->group_type)
>                 return true;
> @@ -8922,6 +8923,13 @@ static bool update_pick_idlest(struct sched_group *idlest,
>                 if (idlest_sgs->idle_cpus > sgs->idle_cpus)
>                         return false;
>
> +               if (sched_energy_enabled()) {

This is not enough, the find_energy_efficient_cpu() returns early to
fallback to the default performance mode when the system is
overutilized


> +                   /* Select smaller cpu group for newly woken up forkees */
> +                   if ((sd_flag & SD_BALANCE_FORK) && (idlest_sgs->idle_cpus &&
> +                       !capacity_greater(idlest->sgc->max_capacity, group->sgc->max_capacity)))
> +                       return false;
> +               }
> +
>                 /* Select group with lowest group_util */
>                 if (idlest_sgs->idle_cpus == sgs->idle_cpus &&
>                         idlest_sgs->group_util <= sgs->group_util)
> @@ -8940,7 +8948,7 @@ static bool update_pick_idlest(struct sched_group *idlest,
>   * Assumes p is allowed on at least one CPU in sd.
>   */
>  static struct sched_group *
> -find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu)
> +find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu, int sd_flag)
>  {
>         struct sched_group *idlest = NULL, *local = NULL, *group = sd->groups;
>         struct sg_lb_stats local_sgs, tmp_sgs;
> @@ -8978,7 +8986,7 @@ find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu)
>
>                 update_sg_wakeup_stats(sd, group, sgs, p);
>
> -               if (!local_group && update_pick_idlest(idlest, &idlest_sgs, group, sgs)) {
> +               if (!local_group && update_pick_idlest(idlest, &idlest_sgs, group, sgs, sd_flag)) {
>                         idlest = group;
>                         idlest_sgs = *sgs;
>                 }
> --
> 2.17.1
>



[Index of Archives]     [Linux ARM Kernel]     [Linux ARM]     [Linux Omap]     [Fedora ARM]     [Linux for Sparc]     [IETF Annouce]     [Security]     [Bugtraq]     [Linux MIPS]     [ECOS]     [Asterisk Internet PBX]     [Linux API]

  Powered by Linux