TinyLFU

Author:

Einziger Gil1,Friedman Roy2,Manes Ben3

Affiliation:

1. Nokia Bell Labs, Kfar Saba, Israel

2. Technion, Haifa, Israel

3. Independent

Abstract

This article proposes to use a frequency-based cache admission policy in order to boost the effectiveness of caches subject to skewed access distributions. Given a newly accessed item and an eviction candidate from the cache, our scheme decides, based on the recent access history, whether it is worth admitting the new item into the cache at the expense of the eviction candidate. This concept is enabled through a novel approximate LFU structure called TinyLFU , which maintains an approximate representation of the access frequency of a large sample of recently accessed items. TinyLFU is very compact and lightweight as it builds upon Bloom filter theory. We study the properties of TinyLFU through simulations of both synthetic workloads and multiple real traces from several sources. These simulations demonstrate the performance boost obtained by enhancing various replacement policies with the TinyLFU admission policy. Also, a new combined replacement and eviction policy scheme nicknamed W-TinyLFU is presented. W-TinyLFU is demonstrated to obtain equal or better hit ratios than other state-of-the-art replacement policies on these traces. It is the only scheme to obtain such good results on all traces.

Funder

Israeli Ministry of Science and Technology

Publisher

Association for Computing Machinery (ACM)

Subject

Hardware and Architecture

Cited by 90 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Beyond Belady to Attain a Seemingly Unattainable Byte Miss Ratio for Content Delivery Networks;IEEE Transactions on Parallel and Distributed Systems;2024-11

2. LAC: A Workload Intensity-Aware Caching Scheme for High-Performance SSDs;IEEE Transactions on Computers;2024-07

3. Incremental Least-Recently-Used Algorithm: Good, Robust, and Predictable Performance;2024 IEEE International Conference on Communications Workshops (ICC Workshops);2024-06-09

4. Smart Data-Driven Proactive Push to Edge Network for User-Generated Videos;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

5. LBSC: A Cost-Aware Caching Framework for Cloud Databases;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3