Work

Benchmarking Cache Programming Against Optimal Caching

Year: 2025
Type: conference-paper
Abstract: Lease caches make eviction prescriptive by assigning a compile-time or profile-derived lease to each memory reference, enabling program-guided cache management. This paper presents a reproducible hardware-software evaluation of lease-based cache programming: we implement a lease-cache prototype (CLAM and SHEL) on a single-core RISC‑V emulated on an Altera Cyclone‑V FPGA and compare its measured behavior to a PLRU baseline and to Belady’s OPT computed by an offline Rust simulator. We collect sampled reuse statistics and full traces from PolyBench/C kernels to produce per-reference leases and optimal miss counts. Lease programming closes most of the gap to OPT (average normalized score 67/100), with multi-scope (SHEL) assignments giving higher and more stable gains than single-scope (CLAM); triangular iteration spaces remain the hardest class to optimize. We also show lease-cache rationing is robust to modest under-allocation. The results motivate practical use of lease programming in resource-constrained, fixed-size caches and point to opportunities for runtime adaptation to handle highly irregular access patterns.
Language: English
Open Access status: hybrid
OpenAlex ID: W7126268555
FWCI: 0.307
Cites: 19
Cited by: 1
Related to: 10