Automatic quantification of cache side-channels
The latency gap between caches and main memory has been successfully exploited for
recovering sensitive input to programs, such as cryptographic keys from implementation of …
recovering sensitive input to programs, such as cryptographic keys from implementation of …
[PDF][PDF] A survey on static cache analysis for real-time systems
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 …
stimulus within given time bounds. A vital verification requirement is to estimate the Worst …
Cache-related preemption delay via useful cache blocks: Survey and redefinition
S Altmeyer, CM Burguière - Journal of Systems Architecture, 2011 - Elsevier
Tasks in an embedded system are scheduled either preemptively or non-preemptively. In
case of preemptive scheduling, interferences on the cache of the preempted and preempting …
case of preemptive scheduling, interferences on the cache of the preempted and preempting …
[PDF][PDF] Real time spent on real time
R Wilhelm - Communications of the ACM, 2020 - dl.acm.org
Real time spent on real time Page 1 54 COMMUNICATIONS OF THE ACM | OCTOBER 2020 |
VOL. 63 | NO. 10 contributed articles THE GENERAL SETTING for worst-case execution time …
VOL. 63 | NO. 10 contributed articles THE GENERAL SETTING for worst-case execution time …
[PDF][PDF] A new hybrid approach on WCET analysis for real-time systems using machine learning
The notion of the Worst-Case Execution Time (WCET) allows system engineers to create
safe real-time systems. This value is used to schedule all software tasks before their …
safe real-time systems. This value is used to schedule all software tasks before their …
Static timing analysis for hard real-time systems
Hard real-time systems have to satisfy strict timing constraints. To prove that these
constraints are met, timing analyses aim to derive safe upper bounds on tasks' execution …
constraints are met, timing analyses aim to derive safe upper bounds on tasks' execution …
CAMA: A predictable cache-aware memory allocator
J Herter, P Backes, F Haupenthal… - 2011 23rd Euromicro …, 2011 - ieeexplore.ieee.org
General-purpose dynamic memory allocation algorithms strive for small memory
fragmentation and good average-case response times. Hard real-time settings, in contrast …
fragmentation and good average-case response times. Hard real-time settings, in contrast …
Cache persistence analysis: Theory and practice
C Cullmann - ACM Transactions on Embedded Computing Systems …, 2013 - dl.acm.org
To compute a worst-case execution time (WCET) estimate for a program, the architectural
effects of the underlying hardware must be modeled. For modern processors this results in …
effects of the underlying hardware must be modeled. For modern processors this results in …
WCET analysis with MRU cache: Challenging LRU for predictability
Most previous work on cache analysis for WCET estimation assumes a particular
replacement policy called LRU. In contrast, much less work has been done for non-LRU …
replacement policy called LRU. In contrast, much less work has been done for non-LRU …
How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics
In systems with hard real-time constraints, it is necessary to compute upper bounds on the
worst-case execution time (WCET) of programs; the closer the bound to the real WCET, the …
worst-case execution time (WCET) of programs; the closer the bound to the real WCET, the …