License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ECRTS.2018.6
URN: urn:nbn:de:0030-drops-89978
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8997/
Go to the corresponding LIPIcs Volume Portal


von der Brüggen, Georg ; Piatkowski, Nico ; Chen, Kuan-Hsun ; Chen, Jian-Jia ; Morik, Katharina

Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems

pdf-format:
LIPIcs-ECRTS-2018-6.pdf (0.9 MB)


Abstract

This paper explores the probability of deadline misses for a set of constrained-deadline sporadic soft real-time tasks on uniprocessor platforms. We explore two directions to evaluate the probability whether a job of the task under analysis can finish its execution at (or before) a testing time point t. One approach is based on analytical upper bounds that can be efficiently computed in polynomial time at the price of precision loss for each testing point, derived from the well-known Hoeffding's inequality and the well-known Bernstein's inequality. Another approach convolutes the probability efficiently over multinomial distributions, exploiting a series of state space reduction techniques, i.e., pruning without any loss of precision, and approximations via unifying equivalent classes with a bounded loss of precision. We demonstrate the effectiveness of our approaches in a series of evaluations. Distinct from the convolution-based methods in the literature, which suffer from the high computation demand and are applicable only to task sets with a few tasks, our approaches can scale reasonably without losing much precision in terms of the derived probability of deadline misses.

BibTeX - Entry

@InProceedings{vonderbrggen_et_al:LIPIcs:2018:8997,
  author =	{Georg von der Br{\"u}ggen and Nico Piatkowski and Kuan-Hsun Chen and Jian-Jia Chen and Katharina Morik},
  title =	{{Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems}},
  booktitle =	{30th Euromicro Conference on Real-Time Systems (ECRTS 2018)},
  pages =	{6:1--6:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-075-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{106},
  editor =	{Sebastian Altmeyer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8997},
  URN =		{urn:nbn:de:0030-drops-89978},
  doi =		{10.4230/LIPIcs.ECRTS.2018.6},
  annote =	{Keywords: deadline miss probability, multinomial-based approach, analytical bound}
}

Keywords: deadline miss probability, multinomial-based approach, analytical bound
Seminar: 30th Euromicro Conference on Real-Time Systems (ECRTS 2018)
Issue Date: 2018
Date of publication: 20.06.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI