SF-LRU cache replacement algorithm

Abstract

In this paper we propose a novel replacement algorithm, SF-LRU (Second Chance-FrequencyLeast Recently Used) that combines the LRU (Least Recently Used) and the LFU (Least Frequently Used) using the second chance concept. A comprehensive comparison is made between our algorithm and both LRU and LFU algorithms. Experimental results show that the SF-LRU significantly reduces the number of cache misses compared the other two algorithms. Simulation results show that our algorithm can provide a maximum value of approximately 6.3% improvement in the miss ratio over the LRU algorithm in data cache and approximately 9.3% improvement in miss ratio in instruction cache. This performance improvement is attributed to the fact that our algorithm provides a second chance to the block that may be deleted according to LRU's rules. This is done by comparing the frequency of the block with the block next to it in the set.

Proxy Caching Algorithm based on Segment Group Popularity for Streaming Media

“…Traditional cache algorithm, such as LFU (least frequency used) [26], LRU (least recently used) [27], LRU-K [28], and so on. LFU algorithm often replaces the object with least frequency and value of object is high with the high frequency.…”

Hybrid (LRU) Page-Replacement Algorithm

“…A cache is a component that stores data transparently [5] so that requests for that data can be served faster in future. The data that is stored within a cache might be values that have been computed earlier or duplicates of original values that are stored somewhere else.…”

A cache replacement policy to reduce cache miss rate for multiprocessor architecture

“…Cache pollution caused by mis-prediction of any processor increases the cache miss rate because the processor loads unnecessary data from memory into the cache as in [2]. To resolve the cache miss and cache pollution problem, several cache replacement policies such as random, first-in-first-out, least frequently used, and least recently used policies have been used as in [3,4]. Random cache replacement policy replaces the cache items randomly, and first-in-first-out policy replaces the item which was loaded into the cache first.…”