WRP: Weighting Replacement Policy to Improve Cache Performance

Samiee, Kaveh; Rad, Gholam Ali Rezai

doi:10.1109/csa.2008.61

Cited by 7 publications

(7 citation statements)

References 8 publications

(4 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And consider the time difference ∆T i =Tc i -Tp i where Tc i is the time of last access and Tp i is the time of penultimate access. Then the weighting value of block can be calculated as [1] i i…”

Section: Replacement Strategymentioning

confidence: 99%

“…Database and operating system are two most important ones. Now days, World Wide Web is becoming another popular area of caching [1,2,3]. The objective of this paper is reducing the power consumption by reducing cache misses.…”

Section: Related Workmentioning

confidence: 99%

“…Thus we must have to find out another alternative to improving cache. And replacement policy is one of them [1,3]. Cache performance could be changed by implementing different replacement policy.…”

Section: Introductionmentioning

confidence: 99%

“…Replacement policy specifies the parameters and based on these parameters a new page will be replaced with existing one. Most replacement algorithms in use are based on the time to last access and frequency index but, it fails in some applications [1,2,3]. Other new replacement policy perform better way but, most of them hard to implement.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory

Bhalgama¹,

Kavar²,

Parmar³

2014

IJCTT

View full text Add to dashboard Cite

Section: Replacement Strategymentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory

Bhalgama¹,

Kavar²,

Parmar³

2014

IJCTT

View full text Add to dashboard Cite

“…We assume that all pages, frames size are 3KB and 1KB etc. and reference string of size 3 thousand[7,13].…”

mentioning

confidence: 99%

Comparison of Cache Page Replacement Techniques to Enhance Cache Memory Performance

Pancham¹,

Chaudhary²,

Gupta³

2014

IJCA

View full text Add to dashboard Cite

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] .

show abstract

CWRP: An efficient and classical weight ranking policy for enhancing cache performance

Swain

Marar²,

Motwani³

et al. 2017

2017 Fourth International Conference on Image Information Processing (ICIIP)

View full text Add to dashboard Cite

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).

show abstract

WRP: Weighting Replacement Policy to Improve Cache Performance

Cited by 7 publications

References 8 publications

LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory

LWRP: Low Power Consumption Weighting Replacement Policy using Buffer Memory

Comparison of Cache Page Replacement Techniques to Enhance Cache Memory Performance

CWRP: An efficient and classical weight ranking policy for enhancing cache performance

Contact Info

Product

Resources

About