On the public citation graph
Emulating Optimal Replacement with a Shepherd Cache
0 signed · 45 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/hpca.2004.10015openalex-snapshot
Using Prime Numbers for Cache Indexing to Eliminate Conflict Misses
inferredcites →https://doi.org/10.1109/isca.2004.1310776openalex-snapshot
Adaptive cache compression for high-performance processors
inferredcites →https://doi.org/10.1109/micro.2003.1253183openalex-snapshot
Distance associativity for high-performance energy-efficient non-uniform cache architectures
inferredcites →https://doi.org/10.1109/micro.2006.7openalex-snapshot
Adaptive Caches: Effective Shaping of Cache Behavior to Workloads
inferredcites →https://doi.org/10.1145/1054943.1054945openalex-snapshot
A compressed memory hierarchy using an indirect index cache
inferredcites →https://doi.org/10.1145/1273440.1250709openalex-snapshot
Adaptive insertion policies for high performance caching
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/268806.268810openalex-snapshot
The SimpleScalar tool set, version 2.0
inferredcites →https://doi.org/10.1145/325096.325162openalex-snapshot
Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
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/978-981-13-2372-0_35openalex-snapshot
Role of Cache Replacement Policies in High Performance Computing Systems: A Survey
inferred← citeshttps://doi.org/10.1016/j.micpro.2015.05.005openalex-snapshot
A new cache replacement algorithm for last-level caches by exploiting tag-distance correlation of cache lines
inferred← citeshttps://doi.org/10.1109/aspdac.2012.6164972openalex-snapshot
PRR: A low-overhead cache replacement algorithm for embedded processors
inferred← citeshttps://doi.org/10.1109/hpca.2011.5749733openalex-snapshot
NUcache: An efficient multicore cache organization based on Next-Use distance
inferred← citeshttps://doi.org/10.1109/hpca53966.2022.00048openalex-snapshot
Effective Mimicry of Belady’s MIN Policy
inferred← citeshttps://doi.org/10.1109/hpca53966.2022.00055openalex-snapshot
TCOR: A Tile Cache with Optimal Replacement
inferred← citeshttps://doi.org/10.1109/hpca56546.2023.10071125openalex-snapshot
CARE: A Concurrency-Aware Enhanced Lightweight Cache Management Framework
inferred← citeshttps://doi.org/10.1109/hpca68181.2026.11408600openalex-snapshot
Secret Caching Sauce for High-Performance Secure Memory
inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss.2016.0117openalex-snapshot
AHRC: An Optimized Cache Associativity
inferred← citeshttps://doi.org/10.1109/iccd.2008.4751933openalex-snapshot
Re-examining cache replacement policies
inferred← citeshttps://doi.org/10.1109/iccd.2010.5647594openalex-snapshot
Improving cache performance by combining cost-sensitivity and locality principles in cache replacement algorithms
inferred← citeshttps://doi.org/10.1109/iccd.2014.6974670openalex-snapshot
ReMAP: Reuse and memory access cost aware eviction policy for last level cache management
inferred← citeshttps://doi.org/10.1109/iccd.2017.60openalex-snapshot
DAAIP: Deadblock Aware Adaptive Insertion Policy for High Performance Caching
inferred← citeshttps://doi.org/10.1109/iccd46524.2019.00022openalex-snapshot
Bandwidth-Aware Last-Level Caching: Efficiently Coordinating Off-Chip Read and Write Bandwidth
inferred← citeshttps://doi.org/10.1109/iccit.2010.5711103openalex-snapshot
Partitioning mechanism based on dynamic Allocation of Data entries for chip multiprocessors
inferred← citeshttps://doi.org/10.1109/icicta.2011.582openalex-snapshot
SLRF: A High-efficiency Shared Less Reused Filter in Chip Multiprocessors
inferred← citeshttps://doi.org/10.1109/icsamos.2009.5289241openalex-snapshot
Instruction-based reuse-distance prediction for effective cache management
inferred← citeshttps://doi.org/10.1109/iiswc.2013.6704665openalex-snapshot
Characterizing multi-threaded applications for designing sharing-aware last-level cache replacement policies
inferred← citeshttps://doi.org/10.1109/interact.2012.6339621openalex-snapshot
Enhancing LRU replacement via phantom associativity
inferred← citeshttps://doi.org/10.1109/isca.2016.17openalex-snapshot
Back to the Future: Leveraging Belady's Algorithm for Improved Cache Replacement
inferred← citeshttps://doi.org/10.1109/isca.2018.00020openalex-snapshot
Rethinking Belady's Algorithm to Accommodate Prefetching
inferred← citeshttps://doi.org/10.1109/micro.2012.43openalex-snapshot
Improving Cache Management Policies Using Dynamic Reuse Distances
inferred← citeshttps://doi.org/10.1109/mm.2023.3275079openalex-snapshot
Effective Mimicry of Bélády’s MIN Policy
inferred← citeshttps://doi.org/10.1109/tc.2011.197openalex-snapshot
Exploiting Core Working Sets to Filter the L1 Cache with Random Sampling
inferred← citeshttps://doi.org/10.1145/2677956openalex-snapshot
Mitigating Prefetcher-Caused Pollution Using Informed Caching Policies for Prefetched Blocks
inferred← citeshttps://doi.org/10.1145/3578353.3589543openalex-snapshot
Intelligent Data Migration Policies in a Write-Optimized Copy-on-Write Tiered Storage Stack
inferred← citeshttps://doi.org/10.1145/3591195.3595267openalex-snapshot
Blast from the Past: Least Expected Use (LEU) Cache Replacement with Statistical History
inferred← citeshttps://doi.org/10.1145/3603269.3604813openalex-snapshot
P4LRU: Towards An LRU Cache Entirely in Programmable Data Plane
inferred← citeshttps://doi.org/10.1145/3631461.3631556openalex-snapshot
Tero: Offloading CDN Traffic to Massively Distributed Devices
inferred← citeshttps://doi.org/10.1145/3700426openalex-snapshot
ScaleOPT: A Scalable Optimal Page Replacement Policy Simulator
inferred← citeshttps://doi.org/10.2200/s00922ed1v01y201905cac047openalex-snapshot
Cache Replacement Policies
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.