On the public citation graph

A feasibility study in iterative compilation

0 signed · 69 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/bfb0002894openalex-snapshot
OCEANS: Optimizing compilers for embedded applications
inferredcites →https://doi.org/10.1007/bfb0057974openalex-snapshot
OCEANS: Optimising compilers for embedded applicatioNS
inferredcites →https://doi.org/10.1023/a:1018754616274openalex-snapshot
Combining Loop Transformations Considering Caches and Scheduling
inferredcites →https://doi.org/10.1109/sc.1998.10004openalex-snapshot
Automatically Tuned Linear Algebra Software
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1145/207110.207162openalex-snapshot
Tile size selection using cache organization and data layout
inferredcites →https://doi.org/10.1145/2591635.2667174openalex-snapshot
Optimizing matrix multiply using PHiPAC
inferredcites →https://doi.org/10.1145/263580.263662openalex-snapshot
Optimizing matrix multiply using PHiPAC

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.1014openalex-snapshot
UFS: a global trade‐off strategy for loop unrolling for VLIW architectures
inferred← citeshttps://doi.org/10.1002/spe.2176openalex-snapshot
Analyzing and addressing false interactions during compiler optimization phase ordering
inferred← citeshttps://doi.org/10.1007/3-540-45874-3_10openalex-snapshot
Iterative Compilation
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_165openalex-snapshot
OCEANS - Optimising Compilers for Embedded Applications⋆
inferred← citeshttps://doi.org/10.1007/978-1-4419-6935-4_2openalex-snapshot
ATLAS Version 3.9: Overview and Status
inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_18openalex-snapshot
Piecewise Holistic Autotuning of Compiler and Runtime Parameters
inferred← citeshttps://doi.org/10.1007/978-3-319-71489-9_3openalex-snapshot
Selecting the Best Compiler Optimizations: A Bayesian Network Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-92040-5openalex-snapshot
High Performance Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-13374-9_9openalex-snapshot
Automatically Tuning Parallel and Parallelized Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-36818-9_10openalex-snapshot
Algorithms of the Combination of Compiler Optimization Options for Automatic Performance Tuning
inferred← citeshttps://doi.org/10.1007/bfb0002894openalex-snapshot
OCEANS: Optimizing compilers for embedded applications
inferred← citeshttps://doi.org/10.1007/s00607-016-0535-4openalex-snapshot
A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details
inferred← citeshttps://doi.org/10.1007/s11227-013-1049-xopenalex-snapshot
A methodology for speeding up edge and line detection algorithms focusing on memory architecture utilization
inferred← citeshttps://doi.org/10.1007/s11227-014-1098-9openalex-snapshot
A Matrix–Matrix Multiplication methodology for single/multi-core architectures using SIMD
inferred← citeshttps://doi.org/10.1007/s11227-015-1409-9openalex-snapshot
A methodology for speeding up matrix vector multiplication for single/multi-core architectures
inferred← citeshttps://doi.org/10.1007/s11227-015-1613-7openalex-snapshot
A high-performance matrix–matrix multiplication methodology for CPU and GPU architectures
inferred← citeshttps://doi.org/10.1016/j.cl.2015.01.003openalex-snapshot
A methodology for speeding up loop kernels by exploiting the software information and the memory architecture
inferred← citeshttps://doi.org/10.1016/j.cl.2018.05.003openalex-snapshot
Coding Ants: Optimization of GPU code using ant colony optimization
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.09.006openalex-snapshot
Empirical performance model-driven data layout optimization and library call selection for tensor contraction expressions
inferred← citeshttps://doi.org/10.1023/a:1020989410030openalex-snapshot
Combined Selection of Tile Sizes and Unroll Factors Using Iterative Compilation
inferred← citeshttps://doi.org/10.1093/comjnl/bxt129openalex-snapshot
Identifying Compiler Options to Minimize Energy Consumption for Embedded Platforms
inferred← citeshttps://doi.org/10.1109/access.2022.3147846openalex-snapshot
A Survey of Performance Tuning Techniques and Tools for Parallel Applications
inferred← citeshttps://doi.org/10.1109/cases.2013.6662511openalex-snapshot
Exploiting phase inter-dependencies for faster iterative compiler optimization phase order searches
inferred← citeshttps://doi.org/10.1109/cgo.2003.1191546openalex-snapshot
Compiler optimization-space exploration
inferred← citeshttps://doi.org/10.1109/cgo.2006.15openalex-snapshot
Exhaustive optimization phase order space exploration
inferred← citeshttps://doi.org/10.1109/cgo.2006.38openalex-snapshot
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
inferred← citeshttps://doi.org/10.1109/cgo.2007.9openalex-snapshot
Evaluating Heuristic Optimization Phase Order Search Algorithms
inferred← citeshttps://doi.org/10.1109/cgo.2011.5764669openalex-snapshot
MAO — An extensible micro-architectural optimizer
inferred← citeshttps://doi.org/10.1109/clei.2015.7360010openalex-snapshot
Improved batch elimination: A fast algorithm to identify and remove harmful compiler optimizations
inferred← citeshttps://doi.org/10.1109/estimedia.2014.6962349openalex-snapshot
A Bayesian network approach for compiler auto-tuning for embedded processors
inferred← citeshttps://doi.org/10.1109/ibica.2012.46openalex-snapshot
A Study on Optimizing Execution Time and Code Size in Iterative Compilation
inferred← citeshttps://doi.org/10.1109/icppw.2005.9openalex-snapshot
A Heuristic Search Algorithm Based on Unified Transformation Framework
inferred← citeshttps://doi.org/10.1109/imsccs.2006.11openalex-snapshot
A Lightweight Iterative Compilation Approach for Optimization Parameter Selection
inferred← citeshttps://doi.org/10.1109/ipdps.2011.33openalex-snapshot
Automatic Library Generation for BLAS3 on GPUs
inferred← citeshttps://doi.org/10.1109/pact.2000.888348openalex-snapshot
Combined selection of tile sizes and unroll factors using iterative compilation
inferred← citeshttps://doi.org/10.1109/sc.2004.47openalex-snapshot
Rating Compiler Optimizations for Automatic Performance Tuning
inferred← citeshttps://doi.org/10.1145/1134650.1134663openalex-snapshot
In search of near-optimal optimization phase orderings
inferred← citeshttps://doi.org/10.1145/1152154.1152182openalex-snapshot
Fast, automatic, procedure-level performance tuning
inferred← citeshttps://doi.org/10.1145/1159974.1134663openalex-snapshot
In search of near-optimal optimization phase orderings
inferred← citeshttps://doi.org/10.1145/1353445.1353451openalex-snapshot
PEAK—a fast and effective performance tuning system via compiler optimization orchestration
inferred← citeshttps://doi.org/10.1145/1454115.1454122openalex-snapshot
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
inferred← citeshttps://doi.org/10.1145/1509864.1509865openalex-snapshot
Practical exhaustive optimization phase order exploration and evaluation
inferred← citeshttps://doi.org/10.1145/1755888.1755903openalex-snapshot
Improving both the performance benefits and speed of optimization phase sequence searches
inferred← citeshttps://doi.org/10.1145/1755951.1755903openalex-snapshot
Improving both the performance benefits and speed of optimization phase sequence searches
inferred← citeshttps://doi.org/10.1145/1878921.1878950openalex-snapshot
Eliminating false phase interactions to reduce optimization phase order search space
inferred← citeshttps://doi.org/10.1145/2928270openalex-snapshot
COBAYN
inferred← citeshttps://doi.org/10.1145/3197978openalex-snapshot
A Survey on Compiler Autotuning using Machine Learning
inferred← citeshttps://doi.org/10.1145/3239235.3240499openalex-snapshot
Assessing the effect of data transformations on test suite compilation
inferred← citeshttps://doi.org/10.1145/3377555.3377886openalex-snapshot
Runtime multi-versioning and specialization inside a memoized speculative loop optimizer
inferred← citeshttps://doi.org/10.1145/3377555.3377890openalex-snapshot
Vectorization-aware loop unrolling with seed forwarding
inferred← citeshttps://doi.org/10.1145/3453483.3454043openalex-snapshot
Developer and user-transparent compiler optimization for interactive applications
inferred← citeshttps://doi.org/10.1145/3517338openalex-snapshot
Object Intersection Captures on Interactive Apps to Drive a Crowd-sourced Replay-based Compiler Optimization
inferred← citeshttps://doi.org/10.1145/3832783.3834484openalex-snapshot
Beyond Single-Level PGO: Understanding and Harnessing Cross-Level Optimization Effects in Industrial Systems
inferred← citeshttps://doi.org/10.1145/780822.781140openalex-snapshot
A comparison of empirical and model-driven optimization
inferred← citeshttps://doi.org/10.1145/781139.781140openalex-snapshot
A comparison of empirical and model-driven optimization
inferred← citeshttps://doi.org/10.11606/t.55.2016.tde-28032016-160827openalex-snapshot
Exploração de sequências de otimização do compilador baseada em técnicas hibridas de mineração de dados complexos
inferred← citeshttps://doi.org/10.1504/ijcse.2009.027002openalex-snapshot
Systematic search within an optimisation space based on Unified Transformation Framework
inferred← citeshttps://doi.org/10.48550/arxiv.1511.02603openalex-snapshot
Iterative compilation on mobile devices
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08228openalex-snapshot
Automatically Tuning the GCC Compiler to Optimize the Performance of Applications Running on Embedded Systems
inferred← citeshttps://doi.org/10.5555/2555729.2555736openalex-snapshot
Exploiting phase inter-dependencies for faster iterative compiler optimization phase order searches
inferred← citeshttps://doi.org/10.5555/517554.825767openalex-snapshot
Combined Selection of Tile Sizes and Unroll Factors Using Iterative Compilation
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.