About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

A Time-predictable Stack Cache

In 2013 Ieee 16th International Symposium on Object/component/service-oriented Real-time Distributed Computing (isorc) — 2013
From

Technical University of Denmark1

Department of Applied Mathematics and Computer Science, Technical University of Denmark2

Embedded Systems Engineering, Department of Applied Mathematics and Computer Science, Technical University of Denmark3

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.

Language: English
Publisher: IEEE
Year: 2013
Proceedings: 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORCIEEE International Symposium on Real-Time Distributed Computing
Types: Conference paper
DOI: 10.1109/ISORC.2013.6913225
ORCIDs: Schoeberl, Martin

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis