On the public citation graph
A Highly Parallel Reuse Distance Analysis Algorithm on GPUs
0 signed · 58 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.1007/3-540-46506-5_5openalex-snapshot
Trace-Driven Memory Simulation: A Survey
inferredcites →https://doi.org/10.1007/978-1-4615-4337-4openalex-snapshot
Loop Tiling for Parallelism
inferredcites →https://doi.org/10.1007/978-3-540-88693-8_44openalex-snapshot
Implementing Decision Trees and Forests on a GPU
inferredcites →https://doi.org/10.1007/s00253-001-0844-0openalex-snapshot
Bioinformatic tools for DNA/protein sequence analysis, functional assignment of genes and protein classification
inferredcites →https://doi.org/10.1016/0166-5316(83)90024-xopenalex-snapshot
Efficient methods for calculating the success function of fixed space replacement policies
inferredcites →https://doi.org/10.1016/j.sysarc.2004.09.004openalex-snapshot
Generating cache hints for improved program efficiency
inferredcites →https://doi.org/10.1023/a:1018734612524openalex-snapshot
Reuse-Driven Tiling for Improving Data Locality
inferredcites →https://doi.org/10.1109/ipdps.2001.924975openalex-snapshot
Improving effective bandwidth through compiler enhancement of global cache reuse
inferredcites →https://doi.org/10.1109/ipdps.2011.46openalex-snapshot
Efficient GPU Implementation for Particle in Cell Algorithm
inferredcites →https://doi.org/10.1109/ipdps.2011.71openalex-snapshot
A New Data Layout for Set Intersection on GPUs
inferredcites →https://doi.org/10.1109/ipdpsw.2010.5470770openalex-snapshot
Performance study of mapping irregular computations on GPUs
inferredcites →https://doi.org/10.1109/ispass.2008.4510744openalex-snapshot
Pinpointing and Exploiting Opportunities for Enhancing Data Reuse
inferredcites →https://doi.org/10.1109/pact.2003.1238004openalex-snapshot
Miss rate prediction across all program inputs
inferredcites →https://doi.org/10.1109/pact.2004.1342546openalex-snapshot
Fair cache sharing and partitioning in a chip multiprocessor architecture
inferredcites →https://doi.org/10.1145/1054943.1054954openalex-snapshot
A study of performance impact of memory controller features in multi-processor server environment
inferredcites →https://doi.org/10.1145/1230100.1230129openalex-snapshot
Interactive k-d tree GPU raytracing
inferredcites →https://doi.org/10.1145/1375634.1375648openalex-snapshot
Sampling-based program locality approximation
inferredcites →https://doi.org/10.1145/1854273.1854286openalex-snapshot
Accelerating multicore reuse distance analysis with sampling and parallelization
inferredcites →https://doi.org/10.1145/2591635.2667181openalex-snapshot
Analytical cache models with applications to cache partitioning
inferredcites →https://doi.org/10.1145/377792.377797openalex-snapshot
Analytical cache models with applications to cache partitioning
inferredcites →https://doi.org/10.1145/773039.773043openalex-snapshot
Calculating stack distances efficiently
inferredcites →https://doi.org/10.1145/773146.773043openalex-snapshot
Calculating stack distances efficiently
inferredcites →https://doi.org/10.1145/780822.781159openalex-snapshot
Predicting whole-program locality through reuse distance analysis
inferredcites →https://doi.org/10.1145/781131.781159openalex-snapshot
Predicting whole-program locality through reuse distance analysis
inferredcites →https://doi.org/10.1145/996841.996872openalex-snapshot
Array regrouping and structure splitting using whole-program reference affinity
inferredcites →https://doi.org/10.1147/sj.92.0078openalex-snapshot
Evaluation techniques for storage hierarchies
inferredcites →https://doi.org/10.2172/6051879openalex-snapshot
Efficient methods for calculating the success function of fixed-space replacement policies
inferredcites →https://doi.org/10.5555/1025127.1026001openalex-snapshot
Fair Cache Sharing and Partitioning in a Chip Multiprocessor Architecture
inferredcites →https://doi.org/10.5555/942806.943841openalex-snapshot
Miss rate prediction across all program inputs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11390-014-1460-7openalex-snapshot
Performance Metrics and Models for Shared Cache
inferred← citeshttps://doi.org/10.1016/j.simpat.2018.12.003openalex-snapshot
Analyzing data locality in GPU kernels using memory footprint analysis
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444795openalex-snapshot
Energy-Aware Tile Size Selection for Affine Programs on GPUs
inferred← citeshttps://doi.org/10.1109/hpca.2019.00056openalex-snapshot
Featherlight Reuse-Distance Measurement
inferred← citeshttps://doi.org/10.1109/icpp.2016.71openalex-snapshot
RegTT: Accelerating Tree Traversals on GPUs by Exploiting Regularities
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00070openalex-snapshot
Measuring Cache Complexity Using Data Movement Distance (DMD)
inferred← citeshttps://doi.org/10.1109/ispass.2013.6557169openalex-snapshot
Pinpointing data locality bottlenecks with low overhead
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.2016.2618920openalex-snapshot
Optimizing Locality-Aware Memory Management of Key-Value Caches
inferred← citeshttps://doi.org/10.1145/3291051openalex-snapshot
Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis
inferred← citeshttps://doi.org/10.1145/3297858.3304067openalex-snapshot
Beating OPT with Statistical Clairvoyance and Variable Size Caching
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/3520263.3534651openalex-snapshot
MemSweeper: virtualizing cluster memory management for high memory utilization and isolation
inferred← citeshttps://doi.org/10.1145/3620666.3651353openalex-snapshot
GMT: GPU Orchestrated Memory Tiering for the Big Data Era
inferred← citeshttps://doi.org/10.14293/s2199-1006.1.sor-.ppvowys.v1openalex-snapshot
Parallelize DSW Algorithm
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.