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 discussed.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 eviction is proposed to strengthen the adaptability of the replacement algorithm for multiprocessors.