TY - GEN
T1 - Modified Pseudo LRU replacement algorithm
AU - Ghasemzadeh, Hassan
AU - Mazrouee, Sepideh
AU - Kakoee, Mohammad Reza
PY - 2006
Y1 - 2006
N2 - Although the LRU replacement algorithm has been widely used in cache memory management, it is well-known 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.
AB - Although the LRU replacement algorithm has been widely used in cache memory management, it is well-known 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.
UR - http://www.scopus.com/inward/record.url?scp=34250004967&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34250004967&partnerID=8YFLogxK
U2 - 10.1109/ECBS.2006.52
DO - 10.1109/ECBS.2006.52
M3 - Conference contribution
AN - SCOPUS:34250004967
SN - 0769525466
SN - 9780769525464
T3 - Proceedings of the International Symposium and Workshop on Engineering of Computer Based Systems
SP - 368
EP - 373
BT - Proceedings - 13th Annual IEEE International Symposium and Workshop on Engineering of Computer Based Systems, ECBS 2006
T2 - 13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems, ECBS 2006
Y2 - 27 March 2006 through 30 March 2006
ER -