License
when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2008.1664
URN: urn:nbn:de:0030-drops-16644
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1664/
Altmeyer, Sebastian ; Gebhard, Gernot

WCET Analysis for Preemptive Scheduling

pdf-format:
Dokument 1.pdf (151 KB)

Abstract

Hard real-time systems induce strict constraints on the timing of the task set. Validation of these timing constraints is thus a major challenge during the design of such a system. Whereas the derivation of timing guarantees must already be considered complex if tasks are running to completion, it gets even more complex if tasks are scheduled preemptively -- especially due to caches, deployed to improve the average performance. In this paper we propose a new method to compute valid upper bounds on a task's worst case execution time (WCET). Our method approximates an optimal memory layout such that the set of possibly evicted cache-entries during preemption is minimized. This set then delivers information to bound the execution time of tasks under preemption in an adopted WCET analysis.

BibTeX - Entry

@InProceedings{altmeyer_et_al:DSP:2008:1664,
  author =	{Sebastian Altmeyer and Gernot Gebhard},
  title =	{WCET Analysis for Preemptive Scheduling},
  booktitle =	{8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis},
  year =	{2008},
  editor =	{Raimund Kirner},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1664},
  annote =	{Keywords: WCET, Preemption},
  ISBN =	{978-3-939897-10-1},
  note=		{also published in print by Austrian Computer Society (OCG) under ISBN 978-3-85403-237-3}
}

Keywords: WCET, Preemption
Seminar: 8th International Workshop on Worst-Case Execution Time WCET Analysis (WCET'08)
Issue date: 2008
Date of publication: 13.11.2008

DROPS-Home | Fulltext Search | Imprint Published by LZI