Skip to Main content Skip to Navigation
Conference papers

Efficient Context Switching for the Stack Cache: Implementation and Analysis

Abstract : 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 has been proven to provide good average-case performance, while being 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 and (b) an extension of the design that allows to (partially) hide the overhead by virtualizing stack caches.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01246348
Contributor : Florian Brandner Connect in order to contact the contributor
Submitted on : Friday, December 18, 2015 - 1:27:42 PM
Last modification on : Friday, December 3, 2021 - 11:34:11 AM

Identifiers

Citation

Sahar Abbaspour, Florian Brandner, Amine Naji, Mathieu Jan. Efficient Context Switching for the Stack Cache: Implementation and Analysis. Proceedings of the 23rd International Conference on Real Time and Networks Systems, Julien Forget (Université de Lille, France), Nov 2015, Lille, France. pp.10, ⟨10.1145/2834848.2834861⟩. ⟨hal-01246348⟩

Share

Metrics

Record views

884