CacheQuery: Learning Replacement Policies from Hardware Caches

12/20/2019
by   Pepe Vila, et al.
0

We show how to infer deterministic cache replacement policies using off-the-shelf automata learning and program synthesis techniques. For this, we construct and chain two abstractions that expose the cache replacement policy of any set in the cache hierarchy as a membership oracle to the learning algorithm, based on timing measurements on a silicon CPU. Our experiments demonstrate an advantage in scope and scalability over prior art and uncover 2 previously undocumented cache replacement policies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2019

RELOAD+REFRESH: Abusing Cache Replacement Policies to Perform Stealthy Cache Attacks

Caches have become the prime method for unintended information extractio...
research
06/29/2020

An Imitation Learning Approach for Cache Replacement

Program execution speed critically depends on increasing cache hits, as ...
research
12/02/2015

TinyLFU: A Highly Efficient Cache Admission Policy

This paper proposes to use a frequency based cache admission policy in o...
research
11/03/2022

MUSTACHE: Multi-Step-Ahead Predictions for Cache Eviction

In this work, we propose MUSTACHE, a new page cache replacement algorith...
research
06/15/2020

CoT: Decentralized Elastic Caches for Cloud Environments

Distributed caches are widely deployed to serve social networks and web ...
research
05/21/2017

MITHRIL: Mining Sporadic Associations for Cache Prefetching

The growing pressure on cloud application scalability has accentuated st...
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...

Please sign up or login with your details

Forgot password? Click here to reset