This paper presents an efficient algorithm for providing probabilistic guarantees in soft real-time systems using resource reservations. We use a conservative model for the temporal evolution of a resource reservation, which has a particular structure - a quasi birth death process - enabling an efficient computation of the stationary probability of respecting deadlines. We show the accuracy and the efficiency of the method in a large set of experiments. © 2012 IEEE.
Numerically Efficient Probabilistic Guarantees for Resource Reservations / Manica, Nicola; Palopoli, Luigi; Abeni, Luca. - ELETTRONICO. - (2012), pp. 1-8. ( 2012 IEEE 17th International Conference on Emerging Technologies and Factory Automation, ETFA 2012 Krakow, Poland September 17-21) [10.1109/ETFA.2012.6489566].
Numerically Efficient Probabilistic Guarantees for Resource Reservations
Manica, Nicola;Palopoli, Luigi;Abeni, Luca
2012-01-01
Abstract
This paper presents an efficient algorithm for providing probabilistic guarantees in soft real-time systems using resource reservations. We use a conservative model for the temporal evolution of a resource reservation, which has a particular structure - a quasi birth death process - enabling an efficient computation of the stationary probability of respecting deadlines. We show the accuracy and the efficiency of the method in a large set of experiments. © 2012 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
