R. Santos , J. Santos, J. Orozco
real-time, stochastic guarantees.
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 succesive instantiations is
presented. It is based on a sufficient although not
necessary schedulability condition relating the work
function at each deadline and the deadline itself. The
method shows an acceptable trade-off between exactness
of results and simplicity of calculations.