Beating OPT with Statistical Clairvoyance and Variable Size Caching

24Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Caching techniques are widely used in today's computing infrastructure from virtual memory management to server cache and memory cache. This paper builds on two observations. First, the space utilization in cache can be improved by varying the cache size based on dynamic application demand. Second, it is easier to predict application behavior statistically than precisely. This paper presents a new variable-size cache that uses statistical knowledge of program behavior to maximize the cache performance. We measure performance using data access traces from real-world workloads, including Memcached traces from Facebook and storage traces from Microsoft Research. In an offline setting, the new cache is demonstrated to outperform even OPT, the optimal fixedsize cache which makes use of precise knowledge of program behavior.

Cite

CITATION STYLE

APA

Li, P., Pronovost, C., Wilson, W., Tait, B., Zhou, J., Ding, C., & Criswell, J. (2019). Beating OPT with Statistical Clairvoyance and Variable Size Caching. In International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS (pp. 243–256). Association for Computing Machinery. https://doi.org/10.1145/3297858.3304067

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free