Outperforming LRU with an adaptive replacement cache algorithm

@article{Megiddo2004OutperformingLW,
  title={Outperforming LRU with an adaptive replacement cache algorithm},
  author={N. Megiddo and D. Modha},
  journal={Computer},
  year={2004},
  volume={37},
  pages={58-65}
}
The self-tuning, low-overhead, scan-resistant adaptive replacement cache algorithm outperforms the least-recently-used algorithm by dynamically responding to changing access patterns and continually balancing between workload recency and frequency features. Caching, a fundamental metaphor in modern computing, finds wide application in storage systems, databases, Web servers, middleware, processors, file systems, disk drives, redundant array of independent disks controllers, operating systems… Expand
An Adaptive Dynamic Replacement Approach for a Multicast based Popularity Aware Prefix Cache Memory System
TLDR
An adaptive dynamic cache replacement algorithm for a multimedia servers cache system that responds online to changing access patterns and constantly balances between lru and lfu to improve combined result is proposed. Expand
Implementing a Better Cache Replacement Algorithm in Apache Derby Progress Report
The desire to have large amounts of memory with small access latency is desired by all. Caches provide this effect in a manageable fashion. In databases, the buffer pool acts as a cache to reduce theExpand
An experimental comparison of cache algorithms
TLDR
This paper provides an overview of some much studied cache algorithms as well as a performance comparison of those algorithms by using real life request logs. Expand
Comparison of Cache Page Replacement Techniques to Enhance Cache Memory Performance
TLDR
The 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. Expand
AMP: Program Context Specific Buffer Caching
We present Adaptive Multi-Policy disk caching (AMP), which uses multiple caching policies within one application, and adapts both which policies to use and their relative fraction of the cache, basedExpand
RACE: A Robust Adaptive Caching Strategy for Buffer Cache
TLDR
A novel and simple replacement scheme, called the Robust Adaptive buffer Cache management schemE (RACE), which differentiates the locality of I/O streams by actively detecting access patterns that are inherently exhibited in two correlated spaces. Expand
SSD bufferpool extensions for database systems
TLDR
This work presents a technique for using solid-state storage as a caching layer between RAM and hard disks in database management systems by caching data that is accessed frequently, disk I/O is reduced. Expand
SARC: Sequential Prefetching in Adaptive Replacement Cache
TLDR
A self-tuning, low overhead, simple to implement, locally adaptive, novel cache management policy SARC is designed that dynamically and adaptively partitions the cache space amongst sequential and random streams so as to reduce the read misses. Expand
The Split replacement policy for caches with prefetch blocks
  • 2016
Prefetching is an inbuilt feature of file system and storage caches. The cache replacement policy plays a key role in the performance of prefetching techniques, since a miss occurs if a prefetchExpand
Improving Adaptive Replacement Cache ( ARC ) by Reuse Distance
Buffer caches are used to enhance the performance of file or storage systems by reducing I/O requests to underlying storage media. In particular, multi-level buffer cache hierarchy is commonlyExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 21 REFERENCES
ARC: A Self-Tuning, Low Overhead Replacement Cache
TLDR
The problem of cache management in a demand paging scenario with uniform page sizes is considered and a new cache management policy, namely, Adaptive Replacement Cache (ARC), is proposed that has several advantages. Expand
Data cache management using frequency-based replacement
TLDR
A replacement algorithm based on the concept of maintaining reference counts in which locality has been “factored out” is described, which can offer up to 34% performance improvement over LRU replacement. Expand
The automatic improvement of locality in storage systems
TLDR
It is demonstrated that ALIS considerably outperforms prior techniques, improving the average read performance by up to 50% for server workloads and by about 15% for personal computer workloads, and that the performance improvement persists as disk technology evolves. Expand
Evaluation Techniques for Storage Hierarchies
TLDR
A new and efficient method of determining, in one pass of an address trace, performance measures for a large class of demand-paged, multilevel storage systems utilizing a variety of mapping schemes and replacement algorithms. Expand
LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies
TLDR
Experimental results from trace-driven simulations show that the performance of the LRFU is at least competitive with that of previously known policies for the workloads the authors considered. Expand
LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance
TLDR
LIRS effectively addresses the limits of LRU by using recency to evaluate Inter-Reference Recency (IRR) for making a replacement decision, and significantly outperforms LRU, and outperforms other existing replacement algorithms in most cases. Expand
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
In a path-breaking paper last year Pat and Betty O’Neil and Gerhard Weikum pro posed a self-tuning improvement to the Least Recently Used (LRU) buffer management algorithm[l5]. Their improvement isExpand
WSCLOCK—a simple and effective algorithm for virtual memory management
A new virtual memory management algorithm WSCLOCK has been synthesized from the local working set (WS) algorithm, the global CLOCK algorithm, and a new load control mechanism for auxiliary memoryExpand
A Study of Replacement Algorithms for Virtual-Storage Computer
TLDR
One of the basic limitations of a digital computer is the size of its available memory; an approach that permits the programmer to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions. Expand
Principles of Optimal Page Replacement
TLDR
A formal model is presented for paging algorithms under /-order nonstationary assumptions about program behavior that is expressed as a dynamic programming problem whose solution yields an optimal replacement algorithm. Expand
...
1
2
3
...