The worst-case execution-time problem—overview of methods and survey of tools

R Wilhelm, J Engblom, A Ermedahl, N Holsti… - ACM Transactions on …, 2008 - dl.acm.org
The determination of upper bounds on execution times, commonly called worst-case
execution times (WCETs), is a necessary step in the development and validation process for …

Bus access optimization for predictable implementation of real-time applications on multiprocessor systems-on-chip

J Rosen, A Andrei, P Eles… - 28th IEEE International …, 2007 - ieeexplore.ieee.org
In multiprocessor systems, the traffic on the bus does not solely originate from data transfers
due to data dependencies between tasks, but is also affected by memory transfers as result …

Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems

S Altmeyer, RI Davis, C Maiza - Real-Time Systems, 2012 - Springer
Without the use of caches the increasing gap between processor and memory speeds in
modern embedded microprocessors would have resulted in memory access times becoming …

Density tradeoffs of non-volatile memory as a replacement for SRAM based last level cache

K Korgaonkar, I Bhati, H Liu, J Gaur… - 2018 ACM/IEEE 45th …, 2018 - ieeexplore.ieee.org
Increasing the capacity of the Last Level Cache (LLC) can help scale the memory wall. Due
to prohibitive area and leakage power, however, growing conventional SRAM LLC already …

[PDF][PDF] A survey on static cache analysis for real-time systems

M Lv, N Guan, J Reineke, R Wilhelm… - Leibniz Transactions on …, 2016 - ojs.dagstuhl.de
Real-time systems are reactive computer systems that must produce their reaction to a
stimulus within given time bounds. A vital verification requirement is to estimate the Worst …

Cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems

S Altmeyer, RI Davis, C Maiza - 2011 IEEE 32nd Real-Time …, 2011 - ieeexplore.ieee.org
Without the use of cache the increasing gap between processor and memory speeds in
modern embedded microprocessors would have resulted in memory access times becoming …

Optimal selection of preemption points to minimize preemption overhead

M Bertogna, O Xhani, M Marinoni… - 2011 23rd Euromicro …, 2011 - ieeexplore.ieee.org
A central issue for verifying the schedulability of hard real-time systems is the correct
evaluation of task execution times. These values are significantly influenced by the …

Outstanding paper: Evaluation of cache partitioning for hard real-time systems

S Altmeyer, R Douma, W Lunniss… - 2014 26th Euromicro …, 2014 - ieeexplore.ieee.org
In hard real-time systems, cache partitioning is often suggested as a means of increasing the
predictability of caches in pre-emptively scheduled systems: when a task is assigned its own …

Bounding the shared resource load for the performance analysis of multiprocessor systems

S Schliecker, M Negrean, R Ernst - 2010 Design, Automation & …, 2010 - ieeexplore.ieee.org
Predicting timing behavior is key to reliable real-time system design and verification, but
becomes increasingly difficult for current multiprocessor systems on chip. The integration of …

Enabling compositionality for multicore timing analysis

S Hahn, M Jacobs, J Reineke - … of the 24th international conference on …, 2016 - dl.acm.org
Timing compositionality is assumed by almost all multicore timing analyses. In this paper, we
show that compositional timing analysis can be incorrect even for simple microarchitectures …