A Time-predictable Stack Cache

Sahar Abbaspour; Florian Brandner; Martin Schoeberl

doi:10.1109/ISORC.2013.6913225

A Time-predictable Stack Cache

Sahar Abbaspour, Florian Brandner, Martin Schoeberl

Technical University of Denmark

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

555 Downloads (Pure)

Abstract

Real-time systems need time-predictable architectures to support static worst-case execution time (WCET) analysis. One architectural feature, the data cache, is hard to analyze when different data areas (e.g., heap allocated and stack allocated data) share the same cache. This sharing leads to less precise results of the cache analysis part of the WCET analysis. Splitting the data cache for different data areas enables composable data cache analysis. The WCET analysis tool can analyze the accesses to these different data areas independently. In this paper we present the design and implementation of a cache for stack allocated data. Our port of the LLVM C++ compiler supports the management of the stack cache. The combination of stack cache instructions and the hardware implementation of the stack cache is a further step towards timepredictable architectures.

Original language	English
Title of host publication	2013 IEEE 16th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC)
Number of pages	8
Publisher	IEEE
Publication date	2013
DOIs	https://doi.org/10.1109/ISORC.2013.6913225
Publication status	Published - 2013
Event	16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC - Paderborn, Germany Duration: 19 Jun 2013 → 21 Jun 2013 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6906723

Conference

Conference	16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC
Country/Territory	Germany
City	Paderborn
Period	19/06/2013 → 21/06/2013
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6906723

Bibliographical note

2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Access to Document

10.1109/ISORC.2013.6913225

PatstackAccepted author manuscript, 195 KB

OpenUrl availability

Full text

Cite this

@inproceedings{20ee3ae42cf34fbba895fd627777c0c3,

title = "A Time-predictable Stack Cache",

abstract = "Real-time systems need time-predictable architectures to support static worst-case execution time (WCET) analysis. One architectural feature, the data cache, is hard to analyze when different data areas (e.g., heap allocated and stack allocated data) share the same cache. This sharing leads to less precise results of the cache analysis part of the WCET analysis. Splitting the data cache for different data areas enables composable data cache analysis. The WCET analysis tool can analyze the accesses to these different data areas independently. In this paper we present the design and implementation of a cache for stack allocated data. Our port of the LLVM C++ compiler supports the management of the stack cache. The combination of stack cache instructions and the hardware implementation of the stack cache is a further step towards timepredictable architectures.",

author = "Sahar Abbaspour and Florian Brandner and Martin Schoeberl",

note = "2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.; 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC ; Conference date: 19-06-2013 Through 21-06-2013",

year = "2013",

doi = "10.1109/ISORC.2013.6913225",

language = "English",

booktitle = "2013 IEEE 16th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC)",

publisher = "IEEE",

address = "United States",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6906723",

}

Abbaspour, S, Brandner, F & Schoeberl, M 2013, A Time-predictable Stack Cache. in 2013 IEEE 16th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC) . IEEE, 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC, Paderborn, Germany, 19/06/2013. https://doi.org/10.1109/ISORC.2013.6913225

TY - GEN

T1 - A Time-predictable Stack Cache

AU - Abbaspour, Sahar

AU - Brandner, Florian

AU - Schoeberl, Martin

N1 - 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

PY - 2013

Y1 - 2013

N2 - Real-time systems need time-predictable architectures to support static worst-case execution time (WCET) analysis. One architectural feature, the data cache, is hard to analyze when different data areas (e.g., heap allocated and stack allocated data) share the same cache. This sharing leads to less precise results of the cache analysis part of the WCET analysis. Splitting the data cache for different data areas enables composable data cache analysis. The WCET analysis tool can analyze the accesses to these different data areas independently. In this paper we present the design and implementation of a cache for stack allocated data. Our port of the LLVM C++ compiler supports the management of the stack cache. The combination of stack cache instructions and the hardware implementation of the stack cache is a further step towards timepredictable architectures.

AB - Real-time systems need time-predictable architectures to support static worst-case execution time (WCET) analysis. One architectural feature, the data cache, is hard to analyze when different data areas (e.g., heap allocated and stack allocated data) share the same cache. This sharing leads to less precise results of the cache analysis part of the WCET analysis. Splitting the data cache for different data areas enables composable data cache analysis. The WCET analysis tool can analyze the accesses to these different data areas independently. In this paper we present the design and implementation of a cache for stack allocated data. Our port of the LLVM C++ compiler supports the management of the stack cache. The combination of stack cache instructions and the hardware implementation of the stack cache is a further step towards timepredictable architectures.

U2 - 10.1109/ISORC.2013.6913225

DO - 10.1109/ISORC.2013.6913225

M3 - Article in proceedings

BT - 2013 IEEE 16th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC)

PB - IEEE

T2 - 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC

Y2 - 19 June 2013 through 21 June 2013

ER -

A Time-predictable Stack Cache

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this