On the public citation graph

Loop transformations leveraging hardware prefetching

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.
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.1002/cpe.773openalex-snapshot
The effect of cache models on iterative compilation for combined tiling and unrolling
inferredcites →https://doi.org/10.1002/cpe.v16:2/3openalex-snapshot
inferredcites →https://doi.org/10.1007/978-3-642-28652-0_6openalex-snapshot
Analytical Bounds for Optimal Tile Size Selection
inferredcites →https://doi.org/10.1016/s0167-8191(00)00087-9openalex-snapshot
Automated empirical optimizations of software and the ATLAS project
inferredcites →https://doi.org/10.1109/cgo.2013.6495008openalex-snapshot
Defensive loop tiling for shared cache
inferredcites →https://doi.org/10.1109/hipc.2011.6152742openalex-snapshot
Dynamic selection of tile sizes
inferredcites →https://doi.org/10.1109/icpp.2002.1040857openalex-snapshot
Analysis of memory hierarchy performance of block data layout
inferredcites →https://doi.org/10.1109/icppw.2002.1039779openalex-snapshot
Near-optimal loop tiling by means of cache miss equations and genetic algorithms
inferredcites →https://doi.org/10.1109/jproc.2004.840444openalex-snapshot
Is Search Really Necessary to Generate High-Performance BLAS?
inferredcites →https://doi.org/10.1109/jproc.2004.840848openalex-snapshot
Self-Adapting Linear Algebra Algorithms and Software
inferredcites →https://doi.org/10.1109/sc.1998.10004openalex-snapshot
Automatically Tuned Linear Algebra Software
inferredcites →https://doi.org/10.1109/sc.2012.107openalex-snapshot
Tiling stencil computations to maximize parallelism
inferredcites →https://doi.org/10.1145/106972.106981openalex-snapshot
The cache performance and optimizations of blocked algorithms
inferredcites →https://doi.org/10.1145/106975.106981openalex-snapshot
The cache performance and optimizations of blocked algorithms
inferredcites →https://doi.org/10.1145/1111583.1111589openalex-snapshot
Impact of modern memory subsystems on cache optimizations for stencil computations
inferredcites →https://doi.org/10.1145/113445.113449openalex-snapshot
A data locality optimizing algorithm
inferredcites →https://doi.org/10.1145/1152154.1152190openalex-snapshot
Combining analytical and empirical approaches in tuning matrix transposition
inferredcites →https://doi.org/10.1145/1183401.1183437openalex-snapshot
Profitable loop fusion and tiling using model-driven empirical search
inferredcites →https://doi.org/10.1145/1772954.1772982openalex-snapshot
Automatic creation of tile size selection models
inferredcites →https://doi.org/10.1145/207110.207162openalex-snapshot
Tile size selection using cache organization and data layout
inferredcites →https://doi.org/10.1145/223428.207162openalex-snapshot
Tile size selection using cache organization and data layout
inferredcites →https://doi.org/10.1145/2491956.2462176openalex-snapshot
Halide
inferredcites →https://doi.org/10.1145/2541228.2555292openalex-snapshot
Tile size selection revisited
inferredcites →https://doi.org/10.1145/2628071.2628092openalex-snapshot
OpenTuner
inferredcites →https://doi.org/10.1145/2897824.2925952openalex-snapshot
Automatically scheduling halide image processing pipelines
inferredcites →https://doi.org/10.1145/2925426.2926288openalex-snapshot
TurboTiling
inferredcites →https://doi.org/10.1145/2925987openalex-snapshot
Analytical Modeling Is Enough for High-Performance BLIS
inferredcites →https://doi.org/10.1145/305138.305245openalex-snapshot
A tile selection algorithm for data locality and cache interference
inferredcites →https://doi.org/10.5555/509058.509096openalex-snapshot
Automatically Tuned Linear Algebra Software
inferredcites →https://doi.org/10.5555/520793.825749openalex-snapshot
Memory system support for image processing
inferredcites →https://doi.org/10.7873/date.2015.1033openalex-snapshot
Inter-Tile Reuse Optimization Applied to Bandwidth Constrained Embedded Accelerators

What points at this work

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

inferred← citeshttps://doi.org/10.1109/tc.2020.2980520openalex-snapshot
HePREM: A Predictable Execution Model for GPU-based Heterogeneous SoCs
inferred← citeshttps://doi.org/10.1145/3306346.3322967openalex-snapshot
Learning to optimize halide with tree search and random programs
inferred← citeshttps://doi.org/10.1145/3310248openalex-snapshot
Schedule Synthesis for Halide Pipelines through Reuse Analysis
inferred← citeshttps://doi.org/10.1145/3406117openalex-snapshot
Schedule Synthesis for Halide Pipelines on GPUs
inferred← citeshttps://doi.org/10.1145/3520312.3534863openalex-snapshot
A graph neural network-based performance model for deep learning applications
inferred← citeshttps://doi.org/10.1145/3650200.3656630openalex-snapshot
Tile Size and Loop Order Selection using Machine Learning for Multi-/Many-Core Architectures
inferred← citeshttps://doi.org/10.1145/3676151.3719375openalex-snapshot
Multi-Strided Access Patterns to Boost Hardware Prefetching
inferred← citeshttps://doi.org/10.1145/3721145.3725778openalex-snapshot
UJOpt: Heuristic Approach for Applying Unroll-and-Jam Optimization and Loop Order Selection
inferred← citeshttps://doi.org/10.1145/3806056openalex-snapshot
A Decoupled Analytical Model for Tile Size Selection in Affine Programs
inferred← citeshttps://doi.org/10.33039/ami.2020.07.003openalex-snapshot
Loop optimizations in C and C++ compilers: an overview
inferred← citeshttps://doi.org/10.48550/arxiv.1904.12228openalex-snapshot
Differentiable Visual Computing
inferred← citeshttps://doi.org/10.48550/arxiv.2005.13685openalex-snapshot
ProTuner: Tuning Programs with Monte Carlo Tree Search
inferred← citeshttps://doi.org/10.48550/arxiv.2011.14486openalex-snapshot
Value Function Based Performance Optimization of Deep Learning Workloads
inferred← citeshttps://doi.org/10.48550/arxiv.2108.12489openalex-snapshot
Using Graph Neural Networks to model the performance of Deep Neural Networks
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.