research-article

Open access

Some Mathematical Facts About Optimal Cache Replacement

Author:

Pierre MichaudAuthors Info & Claims

ACM Transactions on Architecture and Code Optimization (TACO), Volume 13, Issue 4

Article No.: 50, Pages 1 - 19

https://doi.org/10.1145/3017992

Published: 16 December 2016 Publication History

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.

References

[1]

A. V. Aho, P. J. Denning, and J. D. Ullman. 1971. Principles of optimal page replacement. Journal of the ACM 18, 1 (Jan. 1971).

Digital Library

[2]

N. Beckmann and D. Sanchez. 2015. Talus: A simple way to remove cliffs in cache performance. In International Symposium on High Performance Computer Architecture (HPCA).

[3]

L. A. Belady. 1966. A study of replacement algorithms for virtual-storage computers. IBM Systems Journal 5, 2 (1966).

Digital Library

[4]

L. A. Belady and F. P. Palermo. 1974. On-line measurement of paging behavior by the multivalued MIN algorithm. IBM Journal of Research and Development 18, 1 (Jan. 1974).

Digital Library

[5]

J. Brock, X. Gu, B. Bao, and C. Ding. 2013. Pacman: Program-assisted cache management. In International Symposium on Memory Management (ISMM).

Digital Library

[6]

D. Burger and T. M. Austin. 1997. The simplescalar tool set, version 2.0. ACM SIGARCH Computer Architecture News 25, 3 (June 1997).

Digital Library

[7]

E. G. Coffman and P. J. Denning. 1973. Operating Systems Theory. Prentice-Hall.

Digital Library

[8]

A. Cohen and W. A. Burkhard. 1995. A proof of the optimality of the MIN paging algorithm using linear programming duality. Operations Research Letters 18, 1 (Aug. 1995).

Digital Library

[9]

A. Jain and C. Lin. 2016. Back to the future: Leveraging Belady’s algorithm for improved cache replacement. In International Symposium on Computer Architecture (ISCA).

Digital Library

[10]

D. E. Knuth. 1985. An analysis of optimum caching. Journal of Algorithms 6, 2 (June 1985).

Digital Library

[11]

M.-K. Lee, P. Michaud, J. S. Sim, and D. Nyang. 2016. A simple proof of optimality for the MIN cache replacement policy. Information Processing. Letters 116, 2 (Feb. 2016).

Digital Library

[12]

W.-F. Lin and S. Reinhardt. 2002. Predicting Last-Touch References Under Optimal Replacement. Technical Report CSE-TR-447-02. University of Michigan.

[13]

R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger. 1970. Evaluation techniques for storage hierarchies. IBM Systems Journal 9, 2 (1970).

Digital Library

[14]

S. McFarling. 1991. Program Analysis And Optimization For Machines With Instruction Cache. Ph.D. dissertation. Stanford University.

Digital Library

[15]

T. R. Puzak. 1985. Analysis of Cache Replacement Algorithms. Ph.D. dissertation. University of Massachusetts Amherst.

Digital Library

[16]

K. Rajan and R. Govindarajan. 2007. Emulating optimal replacement with a shepherd cache. In International Symposium on Microarchitecture (MICRO).

Digital Library

[17]

A. J. Smith. 1976. Analysis of the optimal, look-ahead demand paging algorithms. SIAM Journal on Computing 5, 4 (Dec. 1976).

[18]

J. E. Smith and J. R. Goodman. 1985. Instruction cache replacement policies and organizations. IEEE Transactions on Computers C-34, 3 (March 1985).

Digital Library

[19]

R. A. Sugumar and S. G. Abraham. 1993. Efficient simulation of caches under optimal replacement with applications to miss characterization. In ACM SIGMETRICS.

Digital Library

[20]

O. Temam. 1999. An algorithm for optimally exploiting spatial and temporal locality in upper memory levels. IEEE Transactions on Computers 48, 2 (Feb. 1999).

Digital Library

[21]

B. Van Roy. 2007. A short proof of optimality for the MIN cache replacement algorithm. Information Processing Letters 102, 2 (April 2007).

Digital Library

[22]

W. Vogler. 2008. Another short proof of optimality for the MIN cache replacement algorithm. Information Processing Letters 106, 5 (May 2008).

Digital Library

Cited By

Joseph DAragón JParcerisa JGonzález A(2023)Boustrophedonic Frames: Quasi-Optimal L2 Caching for Textures in GPUs2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT58117.2023.00019(124-136)Online publication date: 21-Oct-2023
https://doi.org/10.1109/PACT58117.2023.00019
Hasslinger GOkhovatzadeh MNtougias KHasslinger FHohlfeld O(2023)An overview of analysis methods and evaluation results for caching strategiesComputer Networks10.1016/j.comnet.2023.109583228(109583)Online publication date: Jun-2023
https://doi.org/10.1016/j.comnet.2023.109583
Ding CChen DLiu FReber BSmith W(2022)CARL: Compiler Assigned Reference LeasingACM Transactions on Architecture and Code Optimization10.1145/349873019:1(1-28)Online publication date: 17-Mar-2022
https://dl.acm.org/doi/10.1145/3498730
Show More Cited By

Index Terms

Some Mathematical Facts About Optimal Cache Replacement
1. Computer systems organization
  1. Architectures
    1. Serial architectures
      1. Superscalar architectures
2. Theory of computation
  1. Design and analysis of algorithms
    1. Online algorithms
      1. Caching and paging algorithms

Recommendations

High performance cache replacement using re-reference interval prediction (RRIP)
ISCA '10: Proceedings of the 37th annual international symposium on Computer architecture

Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy always predicts a near-immediate re-reference interval on cache hits and ...
High performance cache replacement using re-reference interval prediction (RRIP)
ISCA '10

Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy always predicts a near-immediate re-reference interval on cache hits and ...
A new cache replacement algorithm for last-level caches by exploiting tag-distance correlation of cache lines

Cache memory plays a crucial role in determining the performance of processors, especially for embedded processors where area and power are tightly constrained. It is necessary to have effective management mechanisms, such as cache replacement policies, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Architecture and Code Optimization

ACM Transactions on Architecture and Code Optimization Volume 13, Issue 4

December 2016

648 pages

ISSN:1544-3566

EISSN:1544-3973

DOI:10.1145/3012405

Editor:
Koen De Bosschere
Ghent University

Issue’s Table of Contents

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 December 2016

Accepted: 01 November 2016

Revised: 01 November 2016

Received: 01 August 2016

Published in TACO Volume 13, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
1,140
Total Downloads

Downloads (Last 12 months)154
Downloads (Last 6 weeks)14

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Joseph DAragón JParcerisa JGonzález A(2023)Boustrophedonic Frames: Quasi-Optimal L2 Caching for Textures in GPUs2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT58117.2023.00019(124-136)Online publication date: 21-Oct-2023
https://doi.org/10.1109/PACT58117.2023.00019
Hasslinger GOkhovatzadeh MNtougias KHasslinger FHohlfeld O(2023)An overview of analysis methods and evaluation results for caching strategiesComputer Networks10.1016/j.comnet.2023.109583228(109583)Online publication date: Jun-2023
https://doi.org/10.1016/j.comnet.2023.109583
Ding CChen DLiu FReber BSmith W(2022)CARL: Compiler Assigned Reference LeasingACM Transactions on Architecture and Code Optimization10.1145/349873019:1(1-28)Online publication date: 17-Mar-2022
https://dl.acm.org/doi/10.1145/3498730
Song SKhan TShahri SSriraman ASoundararajan NSubramoney SJiménez DLitz HKasikci BSalapura VZahran MChong FTang L(2022)ThermometerProceedings of the 49th Annual International Symposium on Computer Architecture10.1145/3470496.3527430(742-756)Online publication date: 18-Jun-2022
https://dl.acm.org/doi/10.1145/3470496.3527430
Joseph DAragon JParcerisa JGonzalez A(2022)TCOR: A Tile Cache with Optimal Replacement2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA53966.2022.00055(662-675)Online publication date: Apr-2022
https://doi.org/10.1109/HPCA53966.2022.00055
Banditwattanawong TMasdisornchote M(2021)On formulation of online algorithm and framework of near-optimally tractable eviction for nonuniform cachesComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2020.107332178:COnline publication date: 23-Aug-2021
https://dl.acm.org/doi/10.1016/j.comnet.2020.107332
Zhang LKarimi RAhmad IVigfusson Y(2020)Optimal Data Placement for Heterogeneous Cache, Memory, and Storage SystemsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33794724:1(1-27)Online publication date: 5-Jun-2020
https://dl.acm.org/doi/10.1145/3379472
Ben Hassine NMinet PMarinca DBarth D(2019)Popularity prediction–based caching in content delivery networksAnnals of Telecommunications10.1007/s12243-018-00700-874:5-6(351-364)Online publication date: 15-Feb-2019
https://doi.org/10.1007/s12243-018-00700-8
Banditwattanawong T(2018)The Optimality and Complexity of Offline Cache Replacement Policies for Nonuniform ObjectsInternational Journal of Future Computer and Communication10.18178/ijfcc.2018.7.3.5227:3(63-67)Online publication date: Sep-2018
https://doi.org/10.18178/ijfcc.2018.7.3.522
Berger DBeckmann NHarchol-Balter M(2018)Practical Bounds on Optimal Caching with Variable Object SizesProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/32244272:2(1-38)Online publication date: 13-Jun-2018
https://dl.acm.org/doi/10.1145/3224427
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents