Hard Real-Time Systems with Stochastic Execution Times: Deterministic and Probabilistic Guarantees
Rodrigo Santos, Jorge Almeida Santos, Javier Orozco · International Journal of Computers and Applications · 2005
This article presents a method to calculate a lower bound on the probabilistic guarantee that soft real-time tasks of a soft/hard system meet their deadlines in successive instantiations. It is based on a sufficient, although not necessary, schedulability condition relating the work function at etch deadline and the deadline itself. The method shows an acceptable tradeoff between exactness of results and simplicity of calculations.