On the public citation graph

Minimal data dependence abstractions for loop transformations

https://doi.org/10.1007/bfb0025880
0 signed · 42 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-57502-2_60openalex-snapshot
A singular loop transformation framework based on non-singular matrices
inferredcites →https://doi.org/10.1007/b102311openalex-snapshot
Loop Transformations for Restructuring Compilers: The Foundations
inferredcites →https://doi.org/10.1007/bf01379404openalex-snapshot
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
inferredcites →https://doi.org/10.1007/bf01407835openalex-snapshot
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
inferredcites →https://doi.org/10.1007/bf01407931openalex-snapshot
Dataflow analysis of array and scalar references
inferredcites →https://doi.org/10.1109/71.97902openalex-snapshot
A loop transformation theory and an algorithm to maximize parallelism
inferredcites →https://doi.org/10.1109/pgec.1966.264565openalex-snapshot
Analysis of Programs for Parallel Processing
inferredcites →https://doi.org/10.1145/109025.109104openalex-snapshot
Experiences with data dependence abstractions
inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot
A practical algorithm for exact array dependence analysis
inferredcites →https://doi.org/10.1145/143095.143132openalex-snapshot
A general framework for iteration-reordering loop transformations
inferredcites →https://doi.org/10.1145/158511.158515openalex-snapshot
Array-data flow analysis and its use in array privatization
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
inferredcites →https://doi.org/10.1145/321406.321418openalex-snapshot
The Organization of Computations for Uniform Recurrence Equations
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/360827.360844openalex-snapshot
The parallel execution of DO loops
inferredcites →https://doi.org/10.1145/73560.73588openalex-snapshot
Supernode partitioning
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.6083/bc386j51bopenalex-snapshot
Experiences with data dependence and loop restructuring in the tiny research tool

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1997.1310openalex-snapshot
Communication-Minimal Tiling of Uniform Dependence Loops
inferred← citeshttps://doi.org/10.1007/11847083_12openalex-snapshot
Impact of Array Data Flow Analysis on the Design of Energy-Efficient Circuits
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_50openalex-snapshot
On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops
inferred← citeshttps://doi.org/10.1007/bfb0017262openalex-snapshot
Communication-minimal tiling of uniform dependence loops
inferred← citeshttps://doi.org/10.1007/bfb0032681openalex-snapshot
Reuse-driven tiling for data locality
inferred← citeshttps://doi.org/10.1007/s11227-011-0660-yopenalex-snapshot
Data locality optimization of interference graphs based on polyhedral computations
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00063-4openalex-snapshot
Unimodular transformations of non-perfectly nested loops
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00020-9openalex-snapshot
Loop parallelization algorithms: From parallelism extraction to code generation
inferred← citeshttps://doi.org/10.1023/a:1018734612524openalex-snapshot
Reuse-Driven Tiling for Improving Data Locality
inferred← citeshttps://doi.org/10.1080/01495730108941442openalex-snapshot
EIGENVECTORS-BASED PARALLELISATION OF NESTED LOOPS WITH AFFINE DEPENDENCES
inferred← citeshttps://doi.org/10.1080/01495739708941417openalex-snapshot
ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
inferred← citeshttps://doi.org/10.1080/07408179808966433openalex-snapshot
A formalism to structure and parallelize the integration of cooperative engineering design tasks
inferred← citeshttps://doi.org/10.1109/asap.2003.1212826openalex-snapshot
Multi-dimensional incremental loop fusion for data locality
inferred← citeshttps://doi.org/10.1109/icapp.1996.562904openalex-snapshot
On loop restructuring by converting imperfect to perfect loop nests
inferred← citeshttps://doi.org/10.1109/icapp.1997.651504openalex-snapshot
Eigenvectors-based parallelisation of nested loops with affine dependences
inferred← citeshttps://doi.org/10.1109/iceee2.2018.8391357openalex-snapshot
Improving efficency of mathematical functions in image processing by loop fusion
inferred← citeshttps://doi.org/10.1109/ispass69572.2026.00057openalex-snapshot
PLCG: Parametric Loop Code Generator for Loop Transformation Optimization Benchmarking
inferred← citeshttps://doi.org/10.1109/tpds.2003.1214316openalex-snapshot
Efficient data parallel algorithms for multidimensional array operations based on the ekmr scheme for distributed memory multicomputers
inferred← citeshttps://doi.org/10.1145/2429069.2429127openalex-snapshot
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
inferred← citeshttps://doi.org/10.1145/2480359.2429127openalex-snapshot
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
inferred← citeshttps://doi.org/10.1145/2591635.2591645openalex-snapshot
Author retrospective for semantical interprocedural parallelization
inferred← citeshttps://doi.org/10.1145/3779212.3790183openalex-snapshot
LOOPRAG: Enhancing Loop Transformation Optimization with Retrieval-Augmented Large Language Models
inferred← citeshttps://doi.org/10.70675/ae2e80ddz5505z493dz8f00zbded07e27060openalex-snapshot
Efficient search-based strategies for polyhedral compilation : algorithms and experience in a production compiler
inferred← citeshttps://doi.org/10.70675/ba1152c7zadfaz4d0fzb08fz0f218d038f2aopenalex-snapshot
Automatic Source-to-Source Optimizations using Machine Learning
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.