On the public citation graph

Parameterizing loop fusion for automated empirical tuning

0 signed · 32 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.1007/3-540-45545-0_18openalex-snapshot
A Modal Model of Memory
inferredcites →https://doi.org/10.1007/3-540-45545-0_21openalex-snapshot
Statistical Models for Automatic Performance Tuning
inferredcites →https://doi.org/10.1007/978-3-540-69330-7_8openalex-snapshot
A Cache-Conscious Profitability Model for Empirical Tuning of Loop Fusion
inferredcites →https://doi.org/10.1007/s11227-006-7957-2openalex-snapshot
Automatic tuning of whole applications using direct search and a performance-based transformation system
inferredcites →https://doi.org/10.1016/s0167-8191(00)00034-xopenalex-snapshot
On the complexity of loop fusion
inferredcites →https://doi.org/10.1023/a:1015729001611openalex-snapshot
Adaptive Optimizing Compilers for the 21st Century
inferredcites →https://doi.org/10.1109/cgo.2005.10openalex-snapshot
Combining Models and Guided Empirical Search to Optimize for Multiple Levels of the Memory Hierarchy
inferredcites →https://doi.org/10.1109/cgo.2005.29openalex-snapshot
Predicting Unroll Factors Using Supervised Classification
inferredcites →https://doi.org/10.1109/hpdc.1999.805284openalex-snapshot
Portable petaFLOP/s programming: applying distributed computing methodology to the grid within a single machine room
inferredcites →https://doi.org/10.1109/jproc.2004.840301openalex-snapshot
The Design and Implementation of FFTW3
inferredcites →https://doi.org/10.1109/jproc.2004.840306openalex-snapshot
SPIRAL: Code Generation for DSP Transforms
inferredcites →https://doi.org/10.1109/jproc.2004.840311openalex-snapshot
Synthesis of High-Performance Parallel Programs for a Class of ab Initio Quantum Chemistry Models
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.1145/1055531.1055532openalex-snapshot
The science of deriving dense linear algebra algorithms
inferredcites →https://doi.org/10.1145/197405.197406openalex-snapshot
Compiler transformations for high-performance computing
inferredcites →https://doi.org/10.1145/335231.335244openalex-snapshot
Fast greedy weighted fusion
inferredcites →https://doi.org/10.1145/780822.781141openalex-snapshot
Meta optimization
inferredcites →https://doi.org/10.1177/1094342004038956openalex-snapshot
Improving Memory Hierarchy Performance through Combined Loop Interchange and Multi-Level Fusion
inferredcites →https://doi.org/10.5555/370049.370424openalex-snapshot
A Scalable Cross-Platform Infrastructure for Application Performance Tuning Using Hardware Counters
inferredcites →https://doi.org/10.5555/517554.825767openalex-snapshot
Combined Selection of Tile Sizes and Unroll Factors Using Iterative Compilation

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-3-540-89740-8_24openalex-snapshot
Exploring the Optimization Space of Dense Linear Algebra Kernels
inferred← citeshttps://doi.org/10.1016/j.procs.2010.04.209openalex-snapshot
Understanding memory effects in the automated generation of optimized matrix algebra kernels
inferred← citeshttps://doi.org/10.1109/icpp.2015.106openalex-snapshot
Generating Efficient Tensor Contractions for GPUs
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370637openalex-snapshot
POET: Parameterized Optimizations for Empirical Tuning
inferred← citeshttps://doi.org/10.1145/1183401.1183437openalex-snapshot
Profitable loop fusion and tiling using model-driven empirical search
inferred← citeshttps://doi.org/10.1145/1512762.1512773openalex-snapshot
Automated transformation for performance-critical kernels
inferred← citeshttps://doi.org/10.1145/1654059.1654119openalex-snapshot
Automating the generation of composed linear algebra kernels
inferred← citeshttps://doi.org/10.1145/2629698openalex-snapshot
Reliable Generation of High-Performance Matrix Algebra
inferred← citeshttps://doi.org/10.1504/ijhpsa.2008.021798openalex-snapshot
Model-guided empirical tuning of loop fusion
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.3717openalex-snapshot
Search-based Model-driven Loop Optimizations for Tensor Contractions
inferred← citeshttps://doi.org/10.48550/arxiv.1205.1098openalex-snapshot
Reliable Generation of High-Performance Matrix Algebra
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.