一种基于LRU算法改进的缓存方案研究与实现

LRU（最近最少使用）替换算法在单处理器结构的许多应用中被广泛使用。然而在多处理器结构中，传统LRU算法对降低共享缓存的缺失率并不是最优的。文中研究了基本的缓存块替换算法，在分析LRU算法的基础上，提出基于LRU算法及访问概率改进的缓存方案，综合考虑最近使用次数和访问频率来决定候选的替换块，增强了替换算法对多处理器的适应性。

Study and Implementation of an Improved Cache Concept Based on LRU Algorithm

The LRU （least recently used） replacement algorithm is widely used in many applications of single microprocessor architecture. However, in multiprocessor architecture, the traditional LRU algorithm is not optimal to reduce the shared cache misses. In this paper, basic cache lines replacement algorithms are dis- cussed. Upon a detailed analysis of the LRU algorithm, an improved cache concept based on LRU algorithm combined with access probability, where the recency and frequency are considered for choosing cache lines for the adaptability of the replacement algorithm for muhiprocessors.