lkml.org 
[lkml]   [2006]   [Mar]   [14]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: 2.6.16-rc6-rt1
On Tue, 14 Mar 2006, Ingo Molnar wrote:

>
> * Esben Nielsen <simlo@phys.au.dk> wrote:
>
> > On Tue, 14 Mar 2006, Ingo Molnar wrote:
> >
> > >
> > > * Esben Nielsen <simlo@phys.au.dk> wrote:
> > >
> > > [...]
> > > no. We have to run deadlock detection to avoid things like circular lock
> > > dependencies causing an infinite schedule+wakeup 'storm' during priority
> > > boosting. (like possible with your wakeup based method i think)
> > No, all tasks would just settle on the highest priority and then the
> > wakeups would stop.
>
> you are right, that shouldnt be possible. But how about other, SMP
> artifacts? What if the woken up task runs on another CPU, and the whole
> chain of boosting is thus delayed?
>

Yes, it will take longer that way. But it still ought to be
_deterministic_. PI has never been a cheap. It is only safe guard against
priority inversion.

I am not saying using the scheduler is the best solution and certainly not
the cheapest solution. It just popped up in my head and it seemed to work
and was relatively easy to implement.

Esben


> Ingo
> -
> To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
> the body of a message to majordomo@vger.kernel.org
> More majordomo info at http://vger.kernel.org/majordomo-info.html
> Please read the FAQ at http://www.tux.org/lkml/
>

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2006-03-14 23:30    [from the cache]
©2003-2011 Jasper Spaans