Open Access Open Access  Restricted Access Subscription or Fee Access

Analysis and Comparative Study of Cache Replacement Policy

Vipul Dholariya, Madhu Shukla


Day by Day increasing the human activity on internet, operating systems and databases, which create heavy network traffic. One of the measurable step in system designing is caching. It helps to get higher performance in various fields like databases, operating systems and World Wide Web. System performance differs according to various caching policies. Hit-ratio is one of the important factors in cache replacement policy. In caching systems, a replacement policy is necessary for determining when and what to evict from the cache. We discuss in this article about LRU, LFU, FIFO, CAR, OPTIMAL, WRP and AWRP algorithms.


Cache Replacement Policy, Weighting and Ranking Policy, Hit-Miss, Amortize Time

Full Text:



S.M.Shamsheer Daula, Dr. K.E. Sreenivasa Murthy and G amjad Khan, “A Throughput Analysis on Page Replacement Algorithms in Cache Memory Management,” IJERA, vol. 2, pp. 126-130, March-April 2012.

Debabrata Swain, Bancha Nidhi Dash, Debendra O Shamkuwar, Debabala Swain,” Analysis and Predictability of Page Replacement Techniques towards Optimized Performance”, IRCTITCS, pp. 12-16, 2011.

Debabala Swain, Bijay Paikaray and Debabrata Swain, “AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance," Journal of Computing, Volume 3, February 2011.

Kaveh Samiee and GholamAli Rezai Rad, “WRP: Weighting Replacement Policy to Improve Cache Performance,” International Journal of Hybrid Information Technology, vol.2, 2009.

Kaveh Samiee,”A Replacement Algorithm Based on Weighting and Ranking Cache,” International Journal of Hybrid Information Technology, vol.2, April, 2009, pp. 93-103.

Jaafar Alghazo, Adil Akaaboune and Nazeih Botros, “SF-LRU Cache Replacement Algorithm,” MTDT IEEE Conference, 2004.

Donghee Lee, Jongmoo Choi, Jong-Hun Kim, Sam H. Noh, Sang Lyul Min, Yookun Cho and Chong Sang Kim, “LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies,” IEEE Transactions on Computers, vol. 50, no. 12, Dec, 2001, pp. 1352-1360.

Daniel Dominic Sleator and Robert Endre Tarjan, “Self-Adjusting Binary Search Trees,” Journal of the Association for Computing Machinery. Vol. 32, No. 3, July 1985, pp. 652-686.

Wikipedia, (2013, Nov 19). Self-Organizing list [Online]. Available:

Wikipedia, (2013, Nov 19). Skip list [Online]. Available:

Wikipedia, (2013, Nov 19). Splay tree [Online]. Available:

Wikipedia, (2013, Nov 19). Hash table [Online].


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.