id: 06087999
dt: a
an: 06087999
au: Altmeyer, Sebastian; Gebhard, Gernot
ti: WCET analysis for preemptive scheduling.
so: Kimer, Raimund (ed.), 8th international workshop on worst-case execution
    time analysis (WCET’08). Papers based on the presentations at the
    workshop, July 1, 2008, Prague, Czech Republic. Wadern: Schloss
    Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-10-1).
    OASIcs ‒ OpenAccess Series in Informatics 8, 8 p., electronic only
    (2008).
py: 2008
pu: Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik
la: EN
cc: 
ut: WCET; preemption
ci: 
li: doi:10.4230/OASIcs.WCET.2008.1664
ab: Summary: 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.
rv: