Paper Info
Title
Modified Pseudo LRU Replacement Algorithm
Abstract
Although the LRU replacement algorithm has been widely used in cache memory management, it is wellknown for its inability to be easily implemented in hardware. Most of primary caches employ a simple block replacement algorithm like Pseudo LRU to avoid the disadvantages of a complex hardware design. In this paper, we propose a novel block replacement scheme, MPLRU (Modified Pseudo LRU), by exploiting second chance concept in Pseudo LRU algorithm. A comprehensive comparison is made between our algorithm and both true LRU and other conventional schemes such as FIFO, Random and Pseudo LRU. Experimental results show that MPLRU significantly reduces the number of cache misses compared to the other algorithms. Simulation results reveal that in average our algorithm can provide a value of 8.52% improvement on the miss ratio compared to the Pseudo LRU algorithm. Moreover, it provides 7.93% and 11.57% performance improvement compared to FIFO and Random replacement policies respectively.
Year
DOI
Venue
2006
10.1109/ECBS.2006.52
ECBS
Keywords
Field
DocType
complex hardware design,cache memory management,lru replacement algorithm,novel block replacement scheme,modified pseudo lru replacement,simple block replacement algorithm,true lru,modified pseudo lru,random replacement policy,pseudo lru,pseudo lru algorithm,engineering management,cache memory,random number generation,fifo,high performance computing,algorithm design and analysis,computational modeling,memory management,hardware
Algorithm design,FIFO (computing and electronics),Cache,CPU cache,Computer science,Parallel computing,Algorithm,Real-time computing,Cache algorithms,Memory management,Random number generation,Adaptive replacement cache
Conference
ISBN
Citations 
PageRank 
0-7695-2546-6
7
0.77
References 
Authors
5
3
Name
Order
Citations
PageRank
Hassan Ghasemzadeh165661.36
Sepideh Sepideh Mazrouee270.77
Mohammad Reza Kakoee3878.68