CFP last date
20 June 2024
Reseach Article

Comparison of Cache Page Replacement Techniques to Enhance Cache Memory Performance

by Pancham, Deepak Chaudhary, Ruchin Gupta
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 98 - Number 19
Year of Publication: 2014
Authors: Pancham, Deepak Chaudhary, Ruchin Gupta

Pancham, Deepak Chaudhary, Ruchin Gupta . Comparison of Cache Page Replacement Techniques to Enhance Cache Memory Performance. International Journal of Computer Applications. 98, 19 ( July 2014), 27-33. DOI=10.5120/17293-7771

@article{ 10.5120/17293-7771,
author = { Pancham, Deepak Chaudhary, Ruchin Gupta },
title = { Comparison of Cache Page Replacement Techniques to Enhance Cache Memory Performance },
journal = { International Journal of Computer Applications },
issue_date = { July 2014 },
volume = { 98 },
number = { 19 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 27-33 },
numpages = {9},
url = { },
doi = { 10.5120/17293-7771 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-06T22:26:38.561866+05:30
%A Pancham
%A Deepak Chaudhary
%A Ruchin Gupta
%T Comparison of Cache Page Replacement Techniques to Enhance Cache Memory Performance
%J International Journal of Computer Applications
%@ 0975-8887
%V 98
%N 19
%P 27-33
%D 2014
%I Foundation of Computer Science (FCS), NY, USA

Caching is a very important technique for improving the computer system performance, it employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. In modern computer architectures a page miss cause the several hundred CPU cycles [1, 15]. In a memory hierarchy, a cache performs faster than auxiliary storage, but is more expensive. Some important page replacement policies such as FIFO, LRU, RANDOM and SECOND CHANCE are used in cache memory to replace the page whenever it is needed. So page replacement policy severely affects the performance of cache memory. So here our purpose is to simulate FIFO, LRU, RANDOM and SECOND CHANCE policies and to compare the results for various applications such as bzip, swim and gcc traces (taken from SPEC2000 benchmark for simulation) etc. using MS-Excel [3, 10, 12] .

  1. Jan Reineke Daniel Grund "Relative Competitive Analysis of Cache Replacement Policies" LCTES'08, June 12–13, 2008, Tucson, Arizona, USA. Copyrightc 2008 ACM.
  2. S. Jiang, and X. Zhang, "LIRS: An Efficient Policy to improve Buffer Cache Performance",IEEE Transcations on Computers, pp. 939-952, 2005.
  3. S. Albers, S. Arora, and S. Khanna, "Page replacement for general caching problems," Proceedings of the 10th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 31–40, 1999.
  4. Hameed, F. , L. Bauer and J. Henkel, 2013. "Dynamic cache management in multi-core architectures through run-time adaptation. Proceedings of the Design, Automation and Test" in Europe Conference and Exhibition, Mar. 12-16, IEEE Xplore Press, Dresden, pp: 485-490. DOI: 10. 1109/DATE. 2012. 6176518
  5. S. Irani, "Page Replacement with Multi-Size Pages and Applications to Web Caching," Proc. 29th Ann, ACM symp. Theory of Computing, pp. 701-710, 1997.
  6. E. J. O'Neil, P. E. O'Neil, and G. Weikum, "an Optimality Proof of the LRU-K page Replacement Algorithm. " J. ACM, vol. 46, no. 1, pp. 92-112, 1999.
  7. Debabala Swain, Bijay K Paikray, Debabrata Swain,"AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance", Journal of Computing, vol-3, Issue-2, February 2011.
  8. Kaveh Samiee and GholamAli Rezai Rad, "WRP: Weighting Replacement Policy to Improve Cache Performance," International Symposium on Computer Science and its Application, IEEE, 2008.
  9. Yogesh Niranjan, Shailendra Tiwari "Design and Implementation of Page Replacement Algorithm for Web Proxy Caching", Int. J. Computer Technology & Applications,Vol 4 (2),221-225 IJCTA | Mar-Apr 2013.
  10. C. Aggarwal, J. L. Wolf, and P. S. Yu. "Caching on the WorldWideWeb," In IEEE Transactions on Knowledge and Data Engineering, vol. 11, pp. 94-107, 1999.
  11. Nimrod Megiddo, Dharmendra, S. Modha IBM Almaden Research Center Outperforming LRU with an Adaptive Replacement Cache Algorithm, Published by the IEEE Computer Society, 0018-9162/04/$20. 00 © 2004 IEEE.
  12. S. M. Shamsheer Daula, Dr. K. E Sreenivasa Murthy, G Amjad Khan "A Throughput Analysis on Page Replacement Algorithms in Cache Memory Management", International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 Vol. 2, Issue 2, pp. 126-130.
  13. John Dilley, Martine Arlitt and Stephane Perret "Enhancement and Validation of Squid's Cache Replacement Policy" Internet Systems and Applications Laboratory HP Laboratories Palo Alto HPL- 1999-69, May 2009.
  14. Michael Factor, Assaf Schuster, Gala Yadgar, "Multilevel Cache Management Based on Application Hints" Technion- Computer Science Department Technical Report CS-2006.
  15. Amit S. Chavan, Kartik R. Nayak, Keval D. Vora, Manish D. Purohit and Pramila M. Chawan "A Comparison of Page Replacement Algorithms" IACSIT Vol. 3, No. 2, April 201.
  16. A. S. Tanenbaum and A. S. Woodhull, Operating Systems: Design and Implementation. Prentice-Hall, 1997.
  17. Vinit A. Kakde, Sanjay K. Mishra, " Effective Web Cache Algorithm," International Journal of Electronics, Communication & Soft Computing Science and Engineering (IJECSCSE) Volume 1, Issue 1.
  18. http://infocenter. arm. com/help/index. jsp?topic=/com. arm. doc. set. cortexr/index. html
  19. Development of a Virtual Memory Simulator to Analyze the Goodness of Page Replacement Algorithms Fadi N. , Sibai, Maria Ma, David A. Lill
  20. Debabrata Swain, Bancha Nidhi Dash " Analysis and Predictability of Page Replacement Techniques towards Optimized Performance"IRCTITC 2011 Proceedings published in International Journal of Computer Applications® (IJCA).
Index Terms

Computer Science
Information Sciences


Cache performance page replacement policies page faults MS-Excel C-language