lkml.org 
[lkml]   [2010]   [Nov]   [11]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [RFC][PATCH 20/22] sched: drafted deadline inheritance logic
From
Date
On Fri, 2010-10-29 at 08:43 +0200, Raistlin wrote:
> Some method to deal with rt-mutexes and make sched_dl interact with
> the current PI-coded is needed, raising all but trivial issues, that
> needs (according to us) to be solved with some restructuring of
> the pi-code (i.e., going toward a proxy execution-ish implementation).
>
> This is under development, in the meanwhile, as a temporary solution,
> what this commits does is:
> - ensure a pi-lock owner with waiters is never throttled down. Instead,
> when it runs out of runtime, it immediately gets replenished and it's
> deadline is postponed (as in SF_BWRECL_DL reclaiming policy);
> - the scheduling parameters (relative deadline and default runtime)
> used for that replenishments --during the whole period it holds the
> pi-lock-- are the ones of the waiting task with earliest deadline.
>
> Acting this way, we provide some kind of boosting to the lock-owner,
> still by using the existing (actually, slightly modified by the previous
> commit) pi-architecture.

Right, so this is the trivial priority ceiling protocol extended to
bandwidth inheritance and we basically let the owner overrun its runtime
to release the shared resource.

Didn't look at it too closely, but yeah, that is a sensible first
approximation band-aid to keep stuff working.



\
 
 \ /
  Last update: 2010-11-11 23:19    [W:0.349 / U:0.324 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site