Fast and exact analysis for LRU caches

11/05/2018
by   Claire Maiza, et al.
0

For applications in worst-case execution time analysis and in security, it is desirable to statically classify memory accesses into those that result in cache hits, and those that result in cache misses. Among cache replacement policies, the least recently used (LRU) policy has been studied the most and is considered to be the most predictable. The state-of-the-art in LRU cache analysis presents a tradeoff between precision and analysis efficiency: The classical approach to analyzing programs running on LRU caches, an abstract interpretation based on a range abstraction, is very fast but can be imprecise. An exact analysis was recently presented, but, as a last resort, it calls a model checker, which is expensive. In this paper, we develop an analysis based on abstract interpretation that comes close to the efficiency of the classical approach, while achieving exact classification of all memory accesses as the model-checking approach. Compared with the model-checking approach we observe speedups of several orders of magnitude. As a secondary contribution we show that LRU cache analysis problems are in general NP-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2017

Ascertaining Uncertainty for Efficient Exact Cache Analysis

Static cache analysis characterizes a program's cache behavior by determ...
research
09/10/2019

Cache Persistence Analysis: Finally Exact

Cache persistence analysis is an important part of worst-case execution ...
research
11/05/2018

On the complexity of cache analysis for different replacement policies

Modern processors use cache memory: a memory access that "hits" the cach...
research
01/31/2022

The complexity gap in the static analysis of cache accesses grows if procedure calls are added

The static analysis of cache accesses consists in correctly predicting w...
research
01/06/2020

A Fast Analytical Model of Fully Associative Caches

While the cost of computation is an easy to understand local property, t...
research
05/30/2018

BUNDLEP: Prioritizing Conflict Free Regions in Multi-Threaded Programs to Improve Cache Reuse -- Extended Results and Technical Report

In BUNDLE: Real-Time Multi-Threaded Scheduling to Reduce Cache Contentio...
research
07/17/2017

Deterministic Memory Abstraction and Supporting Cache Architecture for Real-Time Systems

Poor timing predictability of multicore processors has been a long-stand...

Please sign up or login with your details

Forgot password? Click here to reset