WCET Analysis for Preemptive Scheduling

Authors Sebastian Altmeyer, Gernot Gebhard



PDF
Thumbnail PDF

File

OASIcs.WCET.2008.1664.pdf
  • Filesize: 151 kB
  • 8 pages

Document Identifiers

Author Details

Sebastian Altmeyer
Gernot Gebhard

Cite AsGet BibTex

Sebastian Altmeyer and Gernot Gebhard. WCET Analysis for Preemptive Scheduling. In 8th International Workshop on Worst-Case Execution Time Analysis (WCET'08). Open Access Series in Informatics (OASIcs), Volume 8, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/OASIcs.WCET.2008.1664

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.
Keywords
  • WCET
  • Preemption

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail