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.
@InProceedings{altmeyer_et_al:OASIcs.WCET.2008.1664, author = {Altmeyer, Sebastian and Gebhard, Gernot}, title = {{WCET Analysis for Preemptive Scheduling}}, booktitle = {8th International Workshop on Worst-Case Execution Time Analysis (WCET'08)}, pages = {1--8}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-10-1}, ISSN = {2190-6807}, year = {2008}, volume = {8}, editor = {Kirner, Raimund}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2008.1664}, URN = {urn:nbn:de:0030-drops-16644}, doi = {10.4230/OASIcs.WCET.2008.1664}, annote = {Keywords: WCET, Preemption} }
Feedback for Dagstuhl Publishing