A Novel Adaptive Cache Replacement Policy using Weighting and Ranking Parameter
Efficient cache replacement policy can improve the performance of processor. Efficient cache replacement has higher hit ratio and low overhead on system. We can improve the performance of system by using efficient cache replacement policy. The basic cache replacement policies, like Least Recently Used (LRU) and Least Frequently Used (LFU), only depends on either recency factor or frequency factor.
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.
Debabala Swain, Bijay Paikaray and Debabrata Swain, “AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance," Journal of Computing, Volume 3, February 2011.
Dr. K a parthasarathy.” Performance evaluation of page removal policies” in journal of theoretical and applied information technology, 15th April 2011, vol. 26 no. 1
Kaveh Samiee, “WRP: Weighting Replacement Policy to Improve Cache Performance,” International Journal of Hybrid Information Technology, vol.2, 2009.
Zhansheng L., Dawei L., and Huijuan B., “CRFP: A novel adaptive replacement policy combined the LRU and LFU policies,” in proceedings of IEEE 8th international conference on computer and information technology workshops, Sydney, pp. 72-79, 2008
Theodore Johnson and Dennis Shasha, “2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm,” Proceedings of the 20th VLDB Conference Santiago, Chile, 1994.
Mr. S. R. Bhalgama, Mr. C. C. Kavar, Mr. S. S. Parmar, “LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory” in International journal of Computer Trends and Technology (IJCTT) volume-7, number-3 pp. 147-150, Jan-2014.
M. Morris Mano. ”Memory Organization” in Computer System Architecture, 3rd Edition, Pearson Prentice Hall, 1992, pp.447-489.