Modern web services use in-memory caching extensively to increase throughput and reduce
latency. There have been several workload analyses of production systems that have fueled …

Despite its success in many areas, deep learning is a poor fit for use in hardware predictors
because these models are impractically large and slow, but this paper shows how we can …

Practical cache replacement policies attempt to emulate optimal replacement by predicting
the re-reference interval of a cache block. The commonly used LRU replacement policy …

This paper introduces a new approach to database disk buffering, called the LRU-K method.
The basic idea of LRU-K is to keep track of the times of the last K references to popular …

Proceedings of FAST ’03: 2nd USENIX Conference on File and Storage Technologies Page 1
USENIX Association Proceedings of FAST ’03: 2nd USENIX Conference on File and Storage …

This paper reports on results and experiences from the COMFORT automatic tuning project.
The objective of the project has been to investigate architectural principles of self-tuning …

In a path-breaking paper last year Pat and Betty O'Neil and Gerhard Weikum proposed a self-
tuning improvement to the Least Recently Used (LRU) bu er management algorithm 15] …

The commonly used LRU replacement policy is susceptible to thrashing for memory-
intensive workloads that have a working set greater than the available cache size. For such …

Efficient and effective buffering of disk blocks in main memory is critical for better file system
performance due to a wide speed gap between main memory and hard disks. In such a …

Although LRU replacement policy has been commonly used in the buffer cache
management, it is well known for its inability to cope with access patterns with weak locality …