[lkml]   [2010]   [Nov]   [12]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [RFC][PATCH 18/22] sched: add reclaiming logic to -deadline tasks
On 12/11/10 17:04, Peter Zijlstra wrote:
> On Fri, 2010-11-12 at 16:36 +0100, Raistlin wrote:
>> But at this point I can't avoid asking. That model aims at _pure_
>> hard real-time scheduling *without* resource reservation capabilities,
>> provided it deals with temporal overruns by means of a probabilistic
>> analysis, right?
>> From what I understood from it, its a soft real-time scheduling
> algorithm with resource reservation. It explicitly allows for deadline
> misses, but requires the tardiness of those misses to be bounded, ie.
> the UNC soft real-time definition.
> The problem the stochastic execution time model tries to address is the
> WCET computation mess, WCET computation is hard and often overly
> pessimistic, resulting in under-utilized systems.
BTW, sorry for the shameless plug, but even with the current
SCHED_DEADLINE you are not forced to dimension the runtime using the
WCET. You can use some stochastic analysis, providing probabilistic
deadline guarantees. See (for example) "QoS Guarantee Using
Probabilistic Deadlines"
and "Stochastic analysis of a reservation based system"
(sorry, this is not easy to download... But I can provide a copy if you
are interested).


 \ /
  Last update: 2010-11-12 18:47    [W:0.158 / U:4.724 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site