Analysis of preemption costs for the stack cache - Archive ouverte HAL Access content directly
Journal Articles Real-Time Systems Year : 2018

Analysis of preemption costs for the stack cache

(1) , (2) , (3) , (4)
1
2
3
4

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 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.
Fichier principal
Vignette du fichier
naji2018.pdf (539.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-01773654 , version 1 (03-01-2019)

Identifiers

Cite

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⟩
111 View
102 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More