arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1811.01670cs.PLcs.CC
收藏

快速准确地分析LRU缓存

Fast and exact analysis for LRU caches

Claire Maïza, Valentin Touzeau, David Monniaux, Jan Reineke

摘要:

对于最坏情况执行时间分析和安全性中的应用,期望静态地将存储器访问分类为导致高速缓存命中的那些和导致高速缓存未命中的那些。在缓存替换策略中,最近最少使用(LRU)策略被研究得最多,被认为是最可预测的。LRU缓存分析的最新技术在精度和分析效率之间进行了权衡:分析在LRU缓存上运行的程序的经典方法,基于范围抽象的抽象解释,非常快,但可能不精确。最近提出了一个精确的分析,但是,作为最后的手段,它调用了模型检查器,这是昂贵的。在本文中,我们开发了一种基于抽象解释的分析,接近经典方法的效率,同时实现了模型检查方法的所有内存访问的精确分类。与模型检查方法相比,我们观察到几个数量级的加速。作为次要的贡献,我们表明,LRU缓存分析问题一般是NP完全的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑