TinyLFU: A highly efficient cache admission policy

Gil Einziger, Roy Friedman

Research output: Contribution to conferencePaperpeer-review

56 Scopus citations

Abstract

This paper proposes to use a frequency based cache admission policy in order to boost the effectiveness of caches subject to skewed access distributions. Rather than deciding on which object to evict, TinyLFU decides, based on the recent access history, whether it is worth admitting an accessed object into the cache at the expense of the eviction candidate. Realizing this concept is enabled through a novel approximate LFU structure called TinyLFU, which maintains an approximate representation of the access frequency of recently accessed objects. TinyLFU is extremely compact and lightweight as it builds upon Bloom filter theory. The paper shows an analysis of the properties of TinyLFU including simulations of both synthetic workloads as well as YouTube and Wikipedia traces.

Original languageEnglish
Pages146-153
Number of pages8
DOIs
StatePublished - 1 Jan 2014
Externally publishedYes
Event2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2014 - Turin, Italy
Duration: 12 Feb 201414 Feb 2014

Conference

Conference2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2014
Country/TerritoryItaly
CityTurin
Period12/02/1414/02/14

Keywords

  • Cache
  • LFU
  • TinyLFU
  • approximate count
  • bloom filter
  • cloud cache
  • data cache
  • sketch
  • sliding window
  • web cache
  • zipf

Cite this