General adaptive replacement policies

Smaragdakis, Yannis

doi:10.1145/1029873.1029887

Cited by 11 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…LRFU [5] is the novel caching algorithms that have attempted to combine recency and frequency (CRF) with the intent of removing one or more disadvantages of LRU. The police always choose a block with minimum value of CRF to evict.…”

Section: Related Workmentioning

confidence: 99%

Adaptive Replacement Policy with Double Stacks for High Performance

Yang¹

2015

Proceedings of the 2015 International Conference on Advances in Mechanical Engineering and Industrial Informatics

View full text Add to dashboard Cite

LRU policy showed the good performance and has been used widely in modern computer, however, the accesses mode of the application is not all preferences of LRU algorithm, there were some drawbacks. In the paper, by researching the existed policy about LRU, we propose an adaptive policy base on the LRU, in this policy, we set double LRU stacks to respectively save the recency and frequency block, and according their efficiency value to adjust dynamically their size. The experiments showed that this method could improve the hit ratio under the different circumstance.

show abstract

Section: Related Workmentioning

confidence: 99%

Adaptive Replacement Policy with Double Stacks for High Performance

Yang¹

2015

Proceedings of the 2015 International Conference on Advances in Mechanical Engineering and Industrial Informatics

View full text Add to dashboard Cite

show abstract

“…They prove robustness of EELRU with respect to LRU. They call a policy A robust with respect to policy B if A is k-miss-competitive relative to B for some k. In subsequent work (Smaragdakis 2004) shows how to construct a policy AB from two given policies A, B, that is 2-robust, i.e. 2-miss-competitive, with respect to both A and B.…”

Section: Related Workmentioning

confidence: 99%

Relative competitive analysis of cache replacement policies

Reineke

Grund

2008

Proceedings of the 2008 ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems

View full text Add to dashboard Cite

Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. On today's architectures a cache miss may cost several hundred CPU cycles.In order to fulfill stringent performance requirements, caches are now also used in hard real-time systems. In such systems, upper and sometimes also lower bounds on the execution times of a task have to be computed. To obtain tight bounds, timing analyses must take into account the cache architecture. However, developing cache analyses -analyses that determine whether a memory access is a hit or a miss -is a difficult problem for some cache architectures.In this paper, we present a tool to automatically compute relative competitive ratios for a large class of replacement policies, including LRU, FIFO, and PLRU. Relative competitive ratios bound the performance of one policy relative to the performance of another policy.These performance relations allow us to use cache-performance predictions for one policy to compute predictions for another, including policies that could previously not be dealt with.

show abstract

“…The problem is very similar to the block replacement in cache memories except that it may argued that the page replacement is more critical as page transfers from disk to memory are orders of magnitudes slower than block transfers from main memory to the cache memory. Many page replacement algorithms [1,[4][5][6][7][8] exist including but not limited to the Not Recently Used (NRU), Second Chance, First In First Out (FIFO), Least Recently Used (LRU), Optimal, and Aging. Good replacement can reduce the page fault cost resulting in higher performance, since the more page faults the operating system encounters, the more resources are wasted on paging in/out instead of doing useful work, resulting ultimately in serious thrashing problems.…”

Section: Introductionmentioning

confidence: 99%

Development of a Virtual Memory Simulator to Analyze the Goodness of Page Replacement Algorithms

Sibai

Ma²,

Lill

2007

2007 Innovations in Information Technologies (IIT)

View full text Add to dashboard Cite

We modified the Java code of the MOSS simulator to develop a robust virtual memory simulator which allows the user to easily switch between diferent page replacement algorithms including FIFO, LRU, and Optimal replacement algorithms. The simulator clearly demonstrates the behavior of the page replacement algorithms in a virtual memory system, andprovides a convenient way to obtain their page fault costs. We ran the simulator under various scenarios including random and mixed random-local memory access patterns. The results indicate that the Optimal algorithm produces the least number of page faults, LRU is general better than FIFO, and that FIFO behavior is unpredictable and illustrates Belady's Anomaly.

show abstract

General adaptive replacement policies

Cited by 11 publications

References 18 publications

Adaptive Replacement Policy with Double Stacks for High Performance

Adaptive Replacement Policy with Double Stacks for High Performance

Relative competitive analysis of cache replacement policies

Development of a Virtual Memory Simulator to Analyze the Goodness of Page Replacement Algorithms

Contact Info

Product

Resources

About