Some mathematical facts about optimal cache replacement - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Architecture and Code Optimization Year : 2016

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.
Fichier principal
Vignette du fichier
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)

Dates and versions

hal-01411156 , version 1 (07-12-2016)
hal-01411156 , version 2 (27-01-2017)

Identifiers

Cite

Pierre Michaud. Some mathematical facts about optimal cache replacement. ACM Transactions on Architecture and Code Optimization, 2016, 13 (4), ⟨10.1145/3017992⟩. ⟨hal-01411156v2⟩
777 View
1450 Download

Altmetric

Share

Gmail Facebook X LinkedIn More