Cache Operations by MRU Change
Cache Operations by MRU Change
复制标题
DOI：
10.1109/12.2208
复制
发表时间：
1988-06
期刊：
影响因子：
--
通讯作者：
K. So;R. Rechtschaffen
中科院分区：
文献类型：
--
作者：
K. So;R. Rechtschaffen
分析了集合关联缓存的性能。使用的方法是将缓存线根据其在缓存的替换堆栈中的位置分组为区域，然后观察CPU的内存访问如何分布在这些区域上。保存的CPU跟踪结果表明，内存访问严重集中在缓存中最近使用的（MRU）区域。介绍了MRU变化的概念；其思想是使用CPU访问非mru线的事件来估计CPU更改其工作集的时间。该概念在缓存设计和性能评估的许多方面都很有用，例如各种替换算法的比较，预取算法的改进以及缓存模拟的加速。>
The performance of set associative caches is analyzed. The method used is to group the cache lines into regions according to their positions in the replacement stacks of a cache, and then to observe how the memory access of a CPU is distributed over these regions. Results from the preserved CPU traces show that the memory accesses are heavily concentrated on the most recently used (MRU) region in the cache. The concept of MRU change is introduced; the idea is to use the event that the CPU accesses a non-MRU line to approximate the time the CPU is changing its working set. The concept is shown to be useful in many aspects of cache design and performance evaluation, such as comparison of various replacement algorithms, improvement of prefetch algorithms, and speedup of cache simulation. >