Some mathematical facts about optimal cache replacement
Abstract
This paper 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.
Domains
Hardware Architecture [cs.AR]
Fichier principal
halopt.pdf (365.43 Ko)
Télécharger le fichier
HiPEAC2017.pdf (435.43 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Presentation
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)