From: Peter Zijlstra on
On Fri, 2010-07-09 at 15:38 +0200, Raistlin wrote:

> - using periods for calculating the tasks' bandwidth and then using
> deadlines for scheduling the tasks is going to work, but the
> admission control test that you would need for ensuring anybody
> will make its deadline is waaay more complex than Sum_i(BW_i)<1, even
> for uniprocessors/partitionig. That one instead would gives you just
> a very basic guarantee that the design in not completely broken
> (formally, I think I should say it is only a necessary
> condition :-)).

Happen to have a paper handy that explains all this in a concise way?
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo(a)vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
From: Peter Zijlstra on
On Fri, 2010-07-09 at 15:38 +0200, Raistlin wrote:
> Basically, from the scheduling point of view, what it could happen is
> that I'm still _NOT_ going to allow a task with runtime Q_i, deadline
> D_i and period P_i to use more bandwidth than Q_i/P_i, I'm still using D
> for scheduling but the passing of the simple in-kernel admission test
> Sum_i(Q_i/P_i)<1 won't guarantee that the task will always finish its
> jobs before D.

But the tardiness would still be bounded, right? So its a valid Soft-RT
model?
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo(a)vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/