Re: [PATCH 00/15] sched: EEVDF and latency-nice and/or slice-attr
From: Peter Zijlstra
Date: Mon Oct 02 2023 - 14:42:37 EST
On Fri, Sep 29, 2023 at 11:54:25AM -0500, Youssef Esmat wrote:
> >
> > EEVDF fundamentally supports per task request/slice sizes, which is the
> > primary motivator for finally finishing these patches.
> >
> > So the plan is to extend sched_setattr() to allow tasks setting their
> > own ideal slice length. But we're not quite there yet.
> >
> > Having just returned from PTO the mailbox is an utter trainwreck, but
> > I'll try and refresh those few patches this week for consideration.
> >
> > In the meantime I think you found the right knob to twiddle.
>
> Hello Peter,
>
> I am trying to understand a little better the need for the eligibility
> checks (entity_eligible). I understand the general concept, but I am
> trying to find a scenario where it is necessary. And maybe propose to
> have it toggled by a feature flag.
My initial response was that it ensures fairness, but thinking a little
about it I'm not so sure anymore.
I do think it features in section 6 lemma 4 and 5, which provide
interference bounds. But I'd have to think a little more about it.
The current setup, where all requests are of equal size, then virtual
deadline tree is basically identical to the virtual runtime tree, just
transposed (in the static state scenario).
When mixing request sizes things become a little more interesting.
Let me ponder this a little bit more.