不同替换策略下缓存分析的复杂性研究
On the complexity of cache analysis for different replacement policies
摘要:
现代处理器使用高速缓存:“命中”高速缓存的内存访问会提前返回,而“未命中”则需要更多时间。给定程序中的内存访问,缓存分析包括决定该访问是否总是命中,总是未命中,或者是命中或未命中,这取决于执行。这样的分析是非常重要的边界的最坏情况下的执行时间的安全关键的实时programmes.There存在多个可能的政策驱逐旧数据从高速缓存时,新的数据被带到,和不同的政策,虽然显然类似的目标和性能,可能是非常不同的从分析的角度来看。在本文中,我们将从复杂性理论的角度探讨这些差异。具体来说,我们表明,在常见的替换政策,LRU(最近最少使用)是唯一一个其分析是NP完全的,而其他政策的分析问题是PSPACE完全的。
英文摘要:
Modern processors use cache memory: a memory access that "hits" the cache returns early, while a "miss" takes more time. Given a memory access in a program, cache analysis consists in deciding whether this access is always a hit, always a miss, or is a hit or a miss depending on execution. Such an analysis is of high importance for bounding the worst-case execution time of safety-critical real-time programs.There exist multiple possible policies for evicting old data from the cache when new data are brought in, and different policies, though apparently similar in goals and performance, may be very different from the analysis point of view. In this paper, we explore these differences from a complexity-theoretical point of view. Specifically, we show that, among the common replacement policies, LRU (Least Recently Used) is the only one whose analysis is NP-complete, whereas the analysis problems for the other policies are PSPACE-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。