R. Santos, J. Santos, and J. Orozco
Real-time, stochastic, probabilistic guarantees
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 suffcient, although not necessary, schedulability condition relating the work function at each deadline and the deadline itself. The method shows an acceptable tradeoff between exactness of results and simplicity of calculations.
Important Links:
Go Back
