Work

Don't Melt Your Cache: Low-Associativity with Heat-Sink

Year: 2025

Type: conference-paper

Abstract: Perhaps the most influential result in the theory of caches is the following theorem due to Sleator and Tarjan: With O(1) resource augmentation, the basic LRU eviction policy is guaranteed to be O(1)-competitive with the optimal offline policy.

Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

DOI: 10.1145/3694906.3743303

Authors: Michael A. Bender, Alex Conway, Daniel DeLayo, Martin Farach-Colton, Jaehyun Han, Linfeng He, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Donald Porter, Evan West

Institutions: Stony Brook University, Cornell Tech, New York University, University of North Carolina at Chapel Hill, Rutgers, The State University of New Jersey, VMware (United States), Carnegie Mellon University

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, Universitas Brawijaya

Awards: Foundations of Data Science Institute, NSF-BSF: Collaborative Research: AF: Small: Algorithmic Performance through History Independence, NSF-BSF: Collaborative Research: AF: Small: Algorithmic Performance through History Independence, G5509021876, Collaborative Research: AF: Medium: Adventures in Flatland: Algorithms for Modern Memories, NRT-HDR: Detecting and Addressing Bias in Data, Humans, and Institutions

OpenAlex ID: W4412482044

FWCI: 1.331

Cites: 17

Cited by: 1

Related to: 10