Skip to main content
Article thumbnail
Location of Repository

An analyticalboundforprobabilistic deadlines

By Luigi Palopoli, Daniele Fontanelli, Nicola Manica and Luca Abeni

Abstract

Abstract—The application of a resource reservation scheduler to soft real–time systems requires effective means to compute the probability of a deadline miss given a particular choice for the scheduling parameters. This is a challenging research problem, for which only numeric solutions, complex and difficult to manage, are currently available. In this paper, we adopt an analytical approach. By using an approximate and conservative model for the evolution of a periodic task scheduled through a reservation, we construct a closed form lower bound for the probability of a deadline miss. Our experiments reveal that the bound remains reasonably close to the experimental probability for many real–time applications of interest. Keywords-Soft real–time systems, Probabilistic Guarantees I

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.307.5372
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://disi.unitn.it/~palopoli... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.