On the public citation graph

Efficient methods for calculating the success function of fixed-space replacement policies

https://doi.org/10.2172/6051879
0 signed · 35 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4615-2361-1_5openalex-snapshot
Non-Stack Single-Pass Simulation
inferred← citeshttps://doi.org/10.1007/978-3-662-46839-5_7openalex-snapshot
Detecting the Temporal Context of Queries
inferred← citeshttps://doi.org/10.1007/s11390-014-1460-7openalex-snapshot
Performance Metrics and Models for Shared Cache
inferred← citeshttps://doi.org/10.1016/s0140-3664(00)00311-xopenalex-snapshot
Optimal Web cache sizing: scalable methods for exact solutions
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00407-8openalex-snapshot
Thin-client Web access patterns: Measurements from a cache-busting proxy
inferred← citeshttps://doi.org/10.1109/12.40842openalex-snapshot
Evaluating associativity in CPU caches
inferred← citeshttps://doi.org/10.1109/dasc-picom-datacom-cyberscitec.2017.43openalex-snapshot
Locality-Driven Dynamic Flash Cache Allocation
inferred← citeshttps://doi.org/10.1109/hpca.2017.11openalex-snapshot
Fast and Accurate Exploration of Multi-level Caches Using Hierarchical Reuse Distance
inferred← citeshttps://doi.org/10.1109/ipdps.2012.100openalex-snapshot
A Highly Parallel Reuse Distance Analysis Algorithm on GPUs
inferred← citeshttps://doi.org/10.1109/ipdps.2012.117openalex-snapshot
PARDA: A Fast Parallel Reuse Distance Analysis Algorithm
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470780openalex-snapshot
Multicore-aware reuse distance analysis
inferred← citeshttps://doi.org/10.1109/isca59077.2024.00021openalex-snapshot
Mind the Gap: Attainable Data Movement and Operational Intensity Bounds for Tensor Algorithms
inferred← citeshttps://doi.org/10.1109/ispass.2017.7975273openalex-snapshot
Accurate address streams for LLC and beyond (SLAB): A methodology to enable system exploration
inferred← citeshttps://doi.org/10.1109/pads.1995.404304openalex-snapshot
Empirical study of parallel trace-driven LRU cache simulators
inferred← citeshttps://doi.org/10.1109/pads.1995.404323openalex-snapshot
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)
inferred← citeshttps://doi.org/10.1109/sc41404.2022.00091openalex-snapshot
Predicting Reuse Interval for Optimized Web Caching: An LSTM-Based Machine Learning Approach
inferred← citeshttps://doi.org/10.1109/tc.2025.3590811openalex-snapshot
LAShards: Low-Overhead and Self-Adaptive MRC Construction for Non-Stack Algorithms
inferred← citeshttps://doi.org/10.1109/tc.2026.3699453openalex-snapshot
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State
inferred← citeshttps://doi.org/10.1109/tcc.2023.3300889openalex-snapshot
Multi-Tenant In-Memory Key-Value Cache Partitioning Using Efficient Random Sampling-Based LRU Model
inferred← citeshttps://doi.org/10.1109/wsc.2004.1371335openalex-snapshot
Approximate Time-Parallel Cache Simulation
inferred← citeshttps://doi.org/10.1145/107971.107995openalex-snapshot
Implementing stack simulation for highly-associative memories
inferred← citeshttps://doi.org/10.1145/107972.107995openalex-snapshot
Implementing stack simulation for highly-associative memories
inferred← citeshttps://doi.org/10.1145/1552309.1552310openalex-snapshot
Program locality analysis using reuse distance
inferred← citeshttps://doi.org/10.1145/200912.200918openalex-snapshot
Set-associative cache simulation using generalized binomial trees
inferred← citeshttps://doi.org/10.1145/3185751openalex-snapshot
Fast Miss Ratio Curve Modeling for Storage Cache
inferred← citeshttps://doi.org/10.1145/3314221.3314606openalex-snapshot
A fast analytical model of fully associative caches
inferred← citeshttps://doi.org/10.1145/3352460.3358264openalex-snapshot
Directed Statistical Warming through Time Traveling
inferred← citeshttps://doi.org/10.1145/3398189openalex-snapshot
A Locality Optimizer for Loop-dominated Applications Based on Reuse Distance Analysis
inferred← citeshttps://doi.org/10.1145/3472456.3472514openalex-snapshot
Efficient Modeling of Random Sampling-Based LRU
inferred← citeshttps://doi.org/10.1145/3524059.3532395openalex-snapshot
Beyond time complexity
inferred← citeshttps://doi.org/10.1145/3746450openalex-snapshot
Continuous-Time Modeling of Zipfian Workload Locality
inferred← citeshttps://doi.org/10.32657/10356/19286openalex-snapshot
Profile driven schemes for energy-sensitive cache hierarchy
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/1340openalex-snapshot
Efficient Modeling of Random Sampling-Based LRU Cache
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/596openalex-snapshot
Modeling Data Center Co-Tenancy Performance Interference
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/653openalex-snapshot
mPart: Miss Ratio Curve Guided Partitioning in Key-Value Stores
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.