HackerPapers

arXiv:1912.09770cs.PL

CacheQuery: Learning Replacement Policies from Hardware Caches

Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

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.

arXiv comments
17 pages, 5 tables, 5 figures
Journal reference
DOI
Subjects
cs.PLProgramming Languages cs.FLFormal Languages and Automata Theory

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Dec 2019 to Dec 2019. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.