LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory
 | International Journal of Computer Trends and Technology (IJCTT) |  |
| © 2014 by IJCTT Journal | ||
| Volume-7 Number-3 | ||
| Year of Publication : 2014 | ||
| Authors : Mr. S.R.Bhalgama , Mr.C.C.Kavar , Mr. S.S.Parmar | ||
| DOI : 10.14445/22312803/IJCTT-V7P142 |
Mr. S.R.Bhalgama , Mr.C.C.Kavar , Mr. S.S.Parmar. Article: LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory. International Journal of Computer Trends and Technology (IJCTT) 7(3):147-150, January 2014. Published by Seventh Sense Research Group.
Abstract-
As the performance gap between memory and processors has increased, then it leads to the poor performance. Efficient virtual memory can overcome this problem. And the efficiency of virtual memory depends on the replacement policy used for cache. In this paper, our algorithm not only based on the time to last access and frequency index but, we also consider the power consumption. We show that Low Power Consumption Weighting Replacement Policy (LWRP) has better performance and low power consumption.
References
[1] J. S. Yoo and S. Shekhar, “A partial Join Approach for mining co-location patterns,” in Proc. of the12th ACM Int’l Work[1] Kaveh Samiee and GholamAli Rezai Rad, “WRP: Weighting Replacement Policy to Improve Cache Performance,” International Symposium on Computer Science and its Application, IEEE, 2008.
[2] Jaafar Alghazo, Adil Akkaboune and Nazeih Botros, “SF-LRU Cache Replacement Algorithm,” MTDT, IEEE, 2004.
[3] Debabala Swain, Bijay Paikaray and Debabrata Swain, “AWRP: Adaptive Weighting Replacement Policy to Improve Cache Performance,” IJournal of Computing, volume 3, Issue 2, February 2011.
[4] Andrew S. Tanenbaum, Modern Operating System, (Pearson Prentice Hall, 2008).
[5] Elizabeth J. O’Neil, Patrick E. O’Neil and Gerhard Weikum, “An Optimally Proof of the LRU-K Page Replacement Algorithm,” Journal of the ACM, vol. 46, No. 1, January 1999, pp. 92-112.
[6] Donghee Lee, Jongmoo choi, Jong-Hun Kim, Sem H. Noh, Sang Lyul Min, Yookun Cho, Chong Sang Kim, “LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies,” IEEE Transaction on computer, vol. 50, no. 12, December 2001.
[7] Sorav Bansal and Dharmendra S. Modha, “CAR: Clock with Adaptive Replacement,” USENIX File and Storage Technologies (FAST), March 31, San Francisco, CA.
[8] G. Memik, G. Reinman and W. Mangione-Sith, “Reducing Energy and Delay Using Efficient Victim Caches,” ISLPED’03, 2003.
[9] Nicolaescu D, Veidenbaum A. and Nicolau A., “Reducing Power Consumption for High-Associative Data Cache in Embedded Processor,” Proc. of the design, automation and test in Europe conf. and exhibition (DATE’03), 2003.
[10] Theodore Johnson and Dennis Shasha, “2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm,” Proceeding of the 20th VLDB Conference Santiago, Chile, 1994
[11] W-T Shiue and C. Chakrabarti, “Memory Exploration for Low Power Embedded Systems,” DAC, 1999.
[12] M. Shell. (2002) IEEEtran homeage on CTAN. [Online]. Available: http://www.ctan.org/tex-archive/macros/latex/contrib/supported/IEEEtran/
Keywords-LFU, LRU, Memory management, replacement policy, weighting replacement policy.