Test of Time Award Presentation
summary
Efficient MRC construction uses deterministic spatial hashing to drive randomized sampling so full miss ratio curves are approximated from large traces without full-address tracking. The SHARDS algorithm produces very high accuracy, adds an adjusted SHARDS correction, and a constant-space variant that builds accurate MRCs for arbitrary trace length in under 1 MB of memory. It extends to ARC and LRU, scales to production traces, and spawns tooling and a company for cache sizing.
AI-written summary · about