Analysis of preemption costs for the stack cache

Amine Naji (1) , Sahar Abbaspour (2) , Florian Brandner (3) , Mathieu Jan (4)

1 U2IS - Unité d'Informatique et d'Ingénierie des Systèmes
2 DTU Compute - Department of Applied Mathematics and Computer Science [Lyngby]
3 LTCI - Laboratoire Traitement et Communication de l'Information
4 DACLE-LIST - Département d'Architectures, Conception et Logiciels Embarqués-LIST

The design of tailored hardware has proven a successful strategy to reduce the timing analysis overhead for (hard) real-time systems. The stack cache is an example of such a design that was shown to provide good average-case performance, while remaining easy to analyze. So far, however, the analysis of the stack cache was limited to individual tasks, ignoring aspects related to multitasking. A major drawback of the original stack cache design is that, due to its simplicity, it cannot hold the data of multiple tasks at the same time. Consequently, the entire cache content needs to be saved and restored when a task is preempted. We propose (a) an analysis exploiting the simplicity of the stack cache to bound the overhead induced by task preemption (b) preemption mechanisms for the stack cache exploiting the previous analysis and, finally, (c) an extension of the design that allows to (partially) hide the overhead by virtualizing stack caches.

Keywords: Program analysis; Stack cache; Cache-related preemption delays; Real-time systems

Domains: Computer Science [cs]

Amine Naji, Sahar Abbaspour, Florian Brandner, Mathieu Jan. Analysis of preemption costs for the stack cache. Real-Time Systems, 2018, ⟨10.1007/s11241-018-9298-7⟩. ⟨cea-01773654⟩