TinyLFU A Highly Efficient Cache Admission Policy (1512.00727) 计算机科学

TinyLFU: A Highly Efficient Cache Admission PolicyGil Einziger∗Dipartimento di Elettronica Politecnico di TorinoItaly gil.einziger@polito.itRoy Friedman Computer Science DepartmentTechnion Haifa 32000, Israelroy@cs.technion.ac.ilBen Manes IndependentBen.Manes@gmail.comAbstractThis paper proposes to use a frequency based cache admission policy in order to boost the ef- fectiveness of caches subject to skewed access distributions. Given a newly accessed item and an eviction candidate from the cach