On the public citation graph

Reuse Distance-Based Probabilistic Cache Replacement

https://doi.org/10.1145/2818374
0 signed · 47 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.1109/iccd.2007.4601909openalex-snapshot
Cache replacement based on reuse-distance prediction
inferredcites →https://doi.org/10.1109/micro.2004.28openalex-snapshot
Pinpointing Representative Portions of Large Intel® Itanium® Programs with Dynamic Instrumentation
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/micro.2007.30openalex-snapshot
Dynamic Warp Formation and Scheduling for Efficient GPU Control Flow
inferredcites →https://doi.org/10.1109/micro.2008.4771793openalex-snapshot
Cache bursts: A new approach for eliminating dead blocks and increasing cache efficiency
inferredcites →https://doi.org/10.1109/micro.2010.24openalex-snapshot
Sampling Dead Block Prediction for Last-Level Caches
inferredcites →https://doi.org/10.1109/micro.2012.43openalex-snapshot
Improving Cache Management Policies Using Dynamic Reuse Distances
inferredcites →https://doi.org/10.1109/mm.2008.44openalex-snapshot
System-Level Performance Metrics for Multiprogram Workloads
inferredcites →https://doi.org/10.1145/1006209.1006213openalex-snapshot
Inter-reference gap distribution replacement
inferredcites →https://doi.org/10.1145/1190215.1190227openalex-snapshot
Locality approximation using time
inferredcites →https://doi.org/10.1145/1190216.1190227openalex-snapshot
Locality approximation using time
inferredcites →https://doi.org/10.1145/1250662.1250709openalex-snapshot
Adaptive insertion policies for high performance caching
inferredcites →https://doi.org/10.1145/139669.139727openalex-snapshot
Cache replacement with dynamic exclusion
inferredcites →https://doi.org/10.1145/170035.170081openalex-snapshot
The LRU-K page replacement algorithm for database disk buffering
inferredcites →https://doi.org/10.1145/1815961.1815971openalex-snapshot
High performance cache replacement using re-reference interval prediction (RRIP)
inferredcites →https://doi.org/10.1145/1816038.1815971openalex-snapshot
High performance cache replacement using re-reference interval prediction (RRIP)
inferredcites →https://doi.org/10.1145/2024724.2024954openalex-snapshot
MARSS
inferredcites →https://doi.org/10.1145/2155620.2155671openalex-snapshot
SHiP
inferredcites →https://doi.org/10.1145/2540708.2540733openalex-snapshot
Insertion and promotion for tree-based PseudoLRU last-level caches
inferredcites →https://doi.org/10.1145/2749469.2750398openalex-snapshot
SLIP
inferredcites →https://doi.org/10.1145/301453.301486openalex-snapshot
EELRU
inferredcites →https://doi.org/10.1145/321623.321632openalex-snapshot
Principles of Optimal Page Replacement
inferredcites →https://doi.org/10.1145/379240.379259openalex-snapshot
Dead-block prediction & dead-block correlating prefetchers
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-03949-4openalex-snapshot
PPT-Multicore: performance prediction of OpenMP applications using reuse profiles and analytical modeling
inferred← citeshttps://doi.org/10.1007/s11554-017-0723-2openalex-snapshot
An extended analysis of memory hierarchies for efficient implementations of image processing applications
inferred← citeshttps://doi.org/10.1109/compcomm.2018.8780696openalex-snapshot
The Attribute-weight Cache Replacement Algorithm for Encrypted Files
inferred← citeshttps://doi.org/10.1109/hpca.2016.7446067openalex-snapshot
Modeling cache performance beyond LRU
inferred← citeshttps://doi.org/10.1109/hpca.2017.43openalex-snapshot
Maximizing Cache Performance Under Uncertainty
inferred← citeshttps://doi.org/10.1109/hpca51647.2021.00033openalex-snapshot
Designing a Cost-Effective Cache Replacement Policy using Machine Learning
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00032openalex-snapshot
A General Offloading Approach for Near-DRAM Processing-In-Memory Architectures
inferred← citeshttps://doi.org/10.1109/micro.2016.7783717openalex-snapshot
Cache-emulated register file: An integrated on-chip memory architecture for high performance GPGPUs
inferred← citeshttps://doi.org/10.1109/pact.2017.32openalex-snapshot
Leeway: Addressing Variability in Dead-Block Prediction for Last-Level Caches
inferred← citeshttps://doi.org/10.1109/tcad.2022.3208769openalex-snapshot
NCache: A Machine-Learning Cache Management Scheme for Computational SSDs
inferred← citeshttps://doi.org/10.1109/tpds.2017.2773516openalex-snapshot
IBOM: An Integrated and Balanced On-Chip Memory for High Performance GPGPUs
inferred← citeshttps://doi.org/10.1145/3287624.3287633openalex-snapshot
A sharing-aware L1.5D cache for data reuse in GPGPUs
inferred← citeshttps://doi.org/10.1145/3323165.3323169openalex-snapshot
Writeback-Aware Caching (Brief Announcement)
inferred← citeshttps://doi.org/10.1145/3422575.3422806openalex-snapshot
PPT-SASMM: Scalable Analytical Shared Memory Model
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/3620666.3651353openalex-snapshot
GMT: GPU Orchestrated Memory Tiering for the Big Data Era
inferred← citeshttps://doi.org/10.1145/3760746openalex-snapshot
SHARP: SHARing-Aware Cache Writeback byPass
inferred← citeshttps://doi.org/10.1587/elex.16.20190351openalex-snapshot
IP-aware cache partition and replacement scheme for mobile computing devices
inferred← citeshttps://doi.org/10.1587/elex.21.20230520openalex-snapshot
Reuse distance-based shared LLC management mechanism for heterogeneous CPU-GPU systems
inferred← citeshttps://doi.org/10.18130/v32600openalex-snapshot
Scrutinizing Resource Utilization for High Performance and Low Energy Computation
inferred← citeshttps://doi.org/10.4018/ijertcs.289202openalex-snapshot
Effectiveness Evaluation of Replacement Policies for On-Chip Caches in Multiprocessors
inferred← citeshttps://doi.org/10.48550/arxiv.1808.05024openalex-snapshot
Making Belady-Inspired Replacement Policies More Effective Using Expected Hit Count
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.