AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance

Details AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance

2011-07-25

arxiv.org/abs/1107.4851v1

Computer Science

Performance

6 pages; Journal of Computing, Volume 3, Issue 2, February 2011, ISSN 2151-9617; http://www.journalofcomputing.org

Scientific paper

Due to the huge difference in performance between the computer memory and processor, the virtual memory management plays a vital role in system performance. A Cache memory is the fast memory which is used to compensate the speed difference between the memory and processor. This paper gives an adaptive replacement policy over the traditional policy which has low overhead, better performance and is easy to implement. Simulations show that our algorithm performs better than Least-Recently-Used (LRU), First-In-First-Out (FIFO) and Clock with Adaptive Replacement (CAR).

Affiliated with

Also associated with

No associations

Rating

AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572085