Efficient context switching for the stack cache: Implementation and analysis

Sahar Abbaspour; Florian Brandner; Amine Naji; Mathieu Jan

doi:10.1145/2834848.2834861

Efficient context switching for the stack cache: Implementation and analysis

Sahar Abbaspour, Florian Brandner, Amine Naji, Mathieu Jan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Proceedings of the 23rd International Conference on Real Time Networks and Systems, RTNS 2015
Publisher	Association for Computing Machinery
Pages	119-128
Number of pages	10
ISBN (Electronic)	9781450335911
DOIs	https://doi.org/10.1145/2834848.2834861
Publication status	Published - 4 Nov 2015
Externally published	Yes
Event	23rd International Conference on Real-Time Networks and Systems, RTNS 2015 - Lille, France Duration: 4 Nov 2015 → 6 Nov 2015

Publication series

Name	ACM International Conference Proceeding Series
Volume	04-06-November-2015

Conference

Conference	23rd International Conference on Real-Time Networks and Systems, RTNS 2015
Country/Territory	France
City	Lille
Period	4/11/15 → 6/11/15

Keywords

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

Access to Document

10.1145/2834848.2834861

Cite this

Abbaspour, S., Brandner, F., Naji, A., & Jan, M. (2015). Efficient context switching for the stack cache: Implementation and analysis. In Proceedings of the 23rd International Conference on Real Time Networks and Systems, RTNS 2015 (pp. 119-128). (ACM International Conference Proceeding Series; Vol. 04-06-November-2015). Association for Computing Machinery. https://doi.org/10.1145/2834848.2834861

@inproceedings{3f931b457e494095a6f7f7d481073b55,

title = "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.",

keywords = "Cache-related preemption delays, Program analysis, Real-time systems, Stack cache",

author = "Sahar Abbaspour and Florian Brandner and Amine Naji and Mathieu Jan",

note = "Publisher Copyright: {\textcopyright} 2015 ACM.; 23rd International Conference on Real-Time Networks and Systems, RTNS 2015 ; Conference date: 04-11-2015 Through 06-11-2015",

year = "2015",

month = nov,

day = "4",

doi = "10.1145/2834848.2834861",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

pages = "119--128",

booktitle = "Proceedings of the 23rd International Conference on Real Time Networks and Systems, RTNS 2015",

}

Abbaspour, S, Brandner, F, Naji, A & Jan, M 2015, Efficient context switching for the stack cache: Implementation and analysis. in Proceedings of the 23rd International Conference on Real Time Networks and Systems, RTNS 2015. ACM International Conference Proceeding Series, vol. 04-06-November-2015, Association for Computing Machinery, pp. 119-128, 23rd International Conference on Real-Time Networks and Systems, RTNS 2015, Lille, France, 4/11/15. https://doi.org/10.1145/2834848.2834861

Efficient context switching for the stack cache: Implementation and analysis. / Abbaspour, Sahar; Brandner, Florian; Naji, Amine et al.
Proceedings of the 23rd International Conference on Real Time Networks and Systems, RTNS 2015. Association for Computing Machinery, 2015. p. 119-128 (ACM International Conference Proceeding Series; Vol. 04-06-November-2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient context switching for the stack cache

T2 - 23rd International Conference on Real-Time Networks and Systems, RTNS 2015

AU - Abbaspour, Sahar

AU - Brandner, Florian

AU - Naji, Amine

AU - Jan, Mathieu

PY - 2015/11/4

Y1 - 2015/11/4

N2 - 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.

AB - 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.

KW - Cache-related preemption delays

KW - Program analysis

KW - Real-time systems

KW - Stack cache

U2 - 10.1145/2834848.2834861

DO - 10.1145/2834848.2834861

M3 - Conference contribution

AN - SCOPUS:84959510239

T3 - ACM International Conference Proceeding Series

SP - 119

EP - 128

BT - Proceedings of the 23rd International Conference on Real Time Networks and Systems, RTNS 2015

PB - Association for Computing Machinery

Y2 - 4 November 2015 through 6 November 2015

ER -

Efficient context switching for the stack cache: Implementation and analysis

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this