Numerically efficient probabilistic guarantees for resource reservations

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 effi...

Full description

Saved in:
Bibliographic Details
Main Authors: Manica, N., Palopoli, L., Abeni, L.
Format: Conference Proceeding
Language:English
Subjects:
Probabilistic Guarantees
Soft real-time systems
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1946-0740
1946-0759
DOI:10.1109/ETFA.2012.6489566