Messages in this thread | ![/](/images/icornerl.gif) | | Date | Mon, 15 Nov 2010 20:39:42 +0100 | From | Luca Abeni <> | Subject | Re: [RFC][PATCH 18/22] sched: add reclaiming logic to -deadline tasks |
| |
On 15/11/10 19:37, James H. Anderson wrote: [...] > If you're talking about our most recent "stochastic" paper, it is about > supporting > soft real-time task systems on a multiprocessor where resource > reservations are > used. The main result of the paper is that if you provision the > reservation for a > task slightly higher than it's average-case execution time [...] BTW, I think we are aligned on this.
I was a little bit surprised when Peter mentioned allocating a runtime equal to the average execution time (because of the meta-stability considerations that Tommaso also mentioned), but I fully agree that if the allocated runtime is higher than the average execution time then the queue is stable and it's possible to find a bound for the expected tardiness (or even its probability distribution... This is similar to my "probabilistic deadlines").
Luca
| ![\](/images/icornerr.gif) |