LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory
Journal Title: INTERNATIONAL JOURNAL OF COMPUTER TRENDS & TECHNOLOGY - Year 2014, Vol 7, Issue 3
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.
Authors and Affiliations
Mr. S. R. Bhalgama , Mr. C. C. Kavar , Mr. S. S. Parmar
Keywords
Related Articles
- EP ID EP136752
- DOI -
- Views 117
- Downloads 0
Embedding a Non-Standard Encryption/Decryption Method with Mathematical Draw Function to Meet Challenges in Mobility
Our innovation and personal information are passes through air in wireless network and their secrecy can be preserved by using any one of the encryption method. Nowadays mobile plays a vital role in passing messages and...
Adaptive Mobile Video Streaming and Efficient Social Video Sharing in Cloud
The mobile phones grow to be an essential part of our everyday life, with smart phone sales at present greater than before very much and also user demands to run lots of applications have enhanced. The victory of next in...
Multi-User License Authentication and Validation System to Protect Against Man in the Middle Attack
Multi-user Software Authentication plays a vital role to authenticate and access software’s through online. Multi-user means multiple users are trying to access the software after purchasing through online with specified...
Tree Based Multicast Routing Protocols for Ad Hoc Networks
The very important dispute in Multicast routing protocols for Manets below host quality and information measure restraint is generating multi-hop routing. In Manets Multicast routing features a very important half. a ran...
Large-Girth Column-Weight Two QC-LDPC Codes
This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The pr...