Abstract
This article exposes and proves some mathematical facts about optimal cache replacement that were previously unknown or not proved rigorously. An explicit formula is obtained, giving OPT hits and misses as a function of past references. Several mathematical facts are derived from this formula, including a proof that OPT miss curves are always convex, and a new algorithm called
OPT tokens
, for reasoning about optimal replacement.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Information Systems,Software
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Boustrophedonic Frames: Quasi-Optimal L2 Caching for Textures in GPUs;2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT);2023-10-21
2. An overview of analysis methods and evaluation results for caching strategies;Computer Networks;2023-06
3. Thermometer;Proceedings of the 49th Annual International Symposium on Computer Architecture;2022-06-11
4. TCOR: A Tile Cache with Optimal Replacement;2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA);2022-04
5. CARL: Compiler Assigned Reference Leasing;ACM Transactions on Architecture and Code Optimization;2022-03-17