lkml.org 
[lkml]   [2010]   [Dec]   [20]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RFC -v2 PATCH 2/3] sched: add yield_to function
On 12/20/2010 10:55 AM, Mike Galbraith wrote:
> > > >
> > > > I don't want it to run now. I want it to run before some other task. I
> > > > don't care if N other tasks run before both. So no godlike powers
> > > > needed, simply a courteous "after you".
> > >
> > > Ponders that...
> > >
> > > What if: we test that both tasks are in the same thread group, if so,
> >
> > In my use case, both tasks are in the same thread group, so that works.
> > I don't see why the requirement is needed though.
>
> Because preempting a perfect stranger is not courteous, all tasks have
> to play nice.

I don't want to preempt anybody, simply make the task run before me.

Further, this is a kernel internal API, so no need for these types of
restrictions. If we expose it to userspace, sure.

> > > use cfs_rq->next to pass the scheduler a HINT of what you would LIKE to
> > > happen.
> >
> > Hint is fine, so long as the scheduler seriously considers it.
>
> It will take the hint if the target the target hasn't had too much cpu.

Since I'm running and the target isn't, it's clear the scheduler thinks
the target had more cpu than I did [73]. That's why I want to donate
cpu time.

[73] at least it'd be clear if the scheduler were globally fair. As it
is, I might be the only task running on my cpu, therefore in a cpu glut,
while the other task shares the cpu with some other task and is
currently waiting for its turn.

> > > If the current task on that rq is also in your group, resched
> > > it, then IFF the task you would like to run isn't too far right, it'll
> > > be selected. If the current task is not one of yours, tough, you can
> > > set cfs_rq->next and hope it doesn't get overwritten, but you may not
> > > preempt a stranger. If you happen to be sharing an rq, cool, you
> > > accomplished your yield_to(). If not, there's no practical way (I can
> > > think of) to ensure that the target runs before you run again if you try
> > > to yield, but you did your best to try to get him to the cpu sooner, and
> > > in a manner that preserves fairness without dangerous vruntime diddling.
> > >
> > > Would that be good enough to stop (or seriously improve) cpu wastage?
> >
> > The cross-cpu limitation is bothersome. Since there are many cpus in
> > modern machines, particularly ones used for virt, the probability of the
> > two tasks being on the same cpu is quite low.
>
> What would you suggest? There is no global execution timeline, so if
> you want to definitely run after this task, you're stuck with moving to
> his timezone or moving him to yours. Well, you could sleep a while, but
> we know how productive sleeping is.

I don't know. The whole idea of donating runtime was predicated on CFS
being completely fair. Now I find that (a) it isn't (b) donating
runtimes between tasks on different cpus is problematic.

Moving tasks between cpus is expensive and sometimes prohibited by
pinning. I'd like to avoid it if possible, but it's better than nothing.

--
error compiling committee.c: too many arguments to function



\
 
 \ /
  Last update: 2010-12-20 10:05    [W:0.129 / U:2.500 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site