2026-08-16T18:44:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1664 2024-03-06T10:28:31Z ddc:004 open_access

WCET Analysis for Preemptive Scheduling Altmeyer, Sebastian Gebhard, Gernot WCET Preemption 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sebastian Altmeyer and Gernot Gebhard 2008 Is Part Of OASIcs, Volume 8, 8th International Workshop on Worst-Case Execution Time Analysis (WCET'08) (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2008.1664 urn:nbn:de:0030-drops-16644 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2008.1664 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode