On the public citation graph

Some Mathematical Facts About Optimal Cache Replacement

https://doi.org/10.1145/3017992
0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0167-6377(95)00021-bopenalex-snapshot
A proof of the optimality of the MIN paging algorithm using linear programming duality
inferredcites →https://doi.org/10.1016/0196-6774(85)90037-9openalex-snapshot
An analysis of optimum caching
inferredcites →https://doi.org/10.1016/j.ipl.2006.11.009openalex-snapshot
A short proof of optimality for the MIN cache replacement algorithm
inferredcites →https://doi.org/10.1016/j.ipl.2007.12.001openalex-snapshot
Another short proof of optimality for the MIN cache replacement algorithm
inferredcites →https://doi.org/10.1016/j.ipl.2015.09.004openalex-snapshot
A simple proof of optimality for the MIN cache replacement policy
inferredcites →https://doi.org/10.1109/12.752656openalex-snapshot
An algorithm for optimally exploiting spatial and temporal locality in upper memory levels
inferredcites →https://doi.org/10.1109/hpca.2015.7056022openalex-snapshot
Talus: A simple way to remove cliffs in cache performance
inferredcites →https://doi.org/10.1109/isca.2016.17openalex-snapshot
Back to the Future: Leveraging Belady's Algorithm for Improved Cache Replacement
inferredcites →https://doi.org/10.1109/micro.2007.14openalex-snapshot
A Framework for Coarse-Grain Optimizations in the On-Chip Memory Hierarchy
inferredcites →https://doi.org/10.1109/tc.1985.1676566openalex-snapshot
Instruction Cache Replacement Policies and Organizations
inferredcites →https://doi.org/10.1137/0205052openalex-snapshot
Analysis of the Optimal, Look-Ahead Demand Paging Algorithms
inferredcites →https://doi.org/10.1145/166955.166974openalex-snapshot
Efficient simulation of caches under optimal replacement with applications to miss characterization
inferredcites →https://doi.org/10.1145/2464157.2466482openalex-snapshot
Pacman
inferredcites →https://doi.org/10.1145/2491894.2466482openalex-snapshot
Pacman
inferredcites →https://doi.org/10.1145/268806.268810openalex-snapshot
The SimpleScalar tool set, version 2.0
inferredcites →https://doi.org/10.1145/3007787.3001146openalex-snapshot
Back to the future
inferredcites →https://doi.org/10.1145/321623.321632openalex-snapshot
Principles of Optimal Page Replacement
inferredcites →https://doi.org/10.1147/rd.181.0002openalex-snapshot
On-line Measurement of Paging Behavior by the Multivalued MIN Algorithm
inferredcites →https://doi.org/10.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer
inferredcites →https://doi.org/10.1147/sj.92.0078openalex-snapshot
Evaluation techniques for storage hierarchies

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s11227-021-03736-1openalex-snapshot
Near-optimal replacement policies for shared caches in multicore processors
inferred← citeshttps://doi.org/10.1007/s12243-018-00700-8openalex-snapshot
Popularity prediction–based caching in content delivery networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2020.107332openalex-snapshot
On formulation of online algorithm and framework of near-optimally tractable eviction for nonuniform caches
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109583openalex-snapshot
An overview of analysis methods and evaluation results for caching strategies
inferred← citeshttps://doi.org/10.1109/globecom46510.2021.9685051openalex-snapshot
RevOPT: An LSTM-based Efficient Caching Strategy for CDN
inferred← citeshttps://doi.org/10.1109/hpca53966.2022.00055openalex-snapshot
TCOR: A Tile Cache with Optimal Replacement
inferred← citeshttps://doi.org/10.1109/isca.2018.00020openalex-snapshot
Rethinking Belady's Algorithm to Accommodate Prefetching
inferred← citeshttps://doi.org/10.1109/pact58117.2023.00019openalex-snapshot
Boustrophedonic Frames: Quasi-Optimal L2 Caching for Textures in GPUs
inferred← citeshttps://doi.org/10.1109/scored.2018.8711066openalex-snapshot
Combining Reused Frequency, Most Recently Used and Program Counter Predictor as Last Level Cache Replacement Policy
inferred← citeshttps://doi.org/10.1145/3219617.3219627openalex-snapshot
Practical Bounds on Optimal Caching with Variable Object Sizes
inferred← citeshttps://doi.org/10.1145/3224427openalex-snapshot
Practical Bounds on Optimal Caching with Variable Object Sizes
inferred← citeshttps://doi.org/10.1145/3379472openalex-snapshot
Optimal Data Placement for Heterogeneous Cache, Memory, and Storage Systems
inferred← citeshttps://doi.org/10.1145/3393691.3394229openalex-snapshot
Optimal Data Placement for Heterogeneous Cache, Memory, and Storage Systems
inferred← citeshttps://doi.org/10.1145/3470496.3527430openalex-snapshot
Thermometer
inferred← citeshttps://doi.org/10.1145/3498730openalex-snapshot
CARL: Compiler Assigned Reference Leasing
inferred← citeshttps://doi.org/10.1145/3705894openalex-snapshot
A Caching-based Framework for Scalable Temporal Graph Neural Network Training
inferred← citeshttps://doi.org/10.1145/3767110.3767131openalex-snapshot
Data Access Complexity: Monotonicity and Proportionality
inferred← citeshttps://doi.org/10.18178/ijfcc.2018.7.3.522openalex-snapshot
The Optimality and Complexity of Offline Cache Replacement Policies for Nonuniform Objects
inferred← citeshttps://doi.org/10.70675/bfcf593fz024bz4fb7zafb4z91d9fde1788copenalex-snapshot
Scheduling task graphs on modern computing platforms
inferred← citeshttps://doi.org/10.70675/d1661a72za7ecz4577z8e31z716d75cac8cdopenalex-snapshot
Machine Learning for Network Resource Management
inferred← citeshttps://doi.org/10.70675/ff9a8713ze4f9z421ez8b99zdfef9781d066openalex-snapshot
Towards compression at all levels in the memory hierarchy
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.