On Composable System Timing, Task Timing, and WCET Analysis
Peter P. Puschner, Martin Schoeberl · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2008
The complexity of hardware and software architectures used in today's embedded systems make a hierarchical, composable timing analysis impossible. This paper describes the source of this complexity in terms of mechanisms and side effects that determine variations in the timing of single tasks and entire applications. Based on these observations, the paper proposes strategies to reduce the complexity. It shows the positive effects of these strategies on the timing of tasks and on WCET analysis.