On the public citation graph
Communication-free parallelization via affine transformations
0 signed · 68 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.1006/jpdc.1993.1094openalex-snapshot
Communication-Free Hyperplane Partitioning of Nested Loops
inferredcites →https://doi.org/10.1007/3-540-57659-2_18openalex-snapshot
Maximizing loop parallelism and improving data locality via loop fusion and distribution
inferredcites →https://doi.org/10.1007/3-540-57659-2_19openalex-snapshot
Align and distribute-based linear loop transformations
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.1109/71.97902openalex-snapshot
A loop transformation theory and an algorithm to maximize parallelism
inferredcites →https://doi.org/10.1109/fmpc.1990.89491openalex-snapshot
Massive parallelism through program restructuring
inferredcites →https://doi.org/10.1109/superc.1992.236704openalex-snapshot
Compiler blockability of numerical algorithms
inferredcites →https://doi.org/10.1145/109625.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/143095.143132openalex-snapshot
A general framework for iteration-reordering loop transformations
inferredcites →https://doi.org/10.1145/143369.143427openalex-snapshot
Optimizing for parallelism and data locality
inferredcites →https://doi.org/10.1145/155090.155101openalex-snapshot
Global optimizations for parallelism and locality on scalable parallel machines
inferredcites →https://doi.org/10.1145/155090.155102openalex-snapshot
Communication optimization and code generation for distributed memory machines
inferredcites →https://doi.org/10.1145/165939.166021openalex-snapshot
Partitioning the statement per iteration space using non-singular matrices
inferredcites →https://doi.org/10.1145/2591635.2667164openalex-snapshot
Optimizing for parallelism and data locality
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/41625.41631openalex-snapshot
Automatic decomposition of scientific programs for parallel execution
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.1996.0134openalex-snapshot
Special Issue on Compilation Techniques for Distributed Memory Systems. Guest Editors' Introduction
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1567openalex-snapshot
A Computation+Communication Load Balanced Loop Partitioning Method for Distributed Memory Systems
inferred← citeshttps://doi.org/10.1007/3-540-44842-x_93openalex-snapshot
Finding Coarse Grained Parallelism in Computational Geometry Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44862-4_100openalex-snapshot
Finding Synchronization-Free Parallelism for Non-uniform Loops
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_10openalex-snapshot
Communication-Free Partitioning of Nested Loops
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_12openalex-snapshot
A Compilation Method for Communication-Efficient Partitioning of DOALL Loops
inferred← citeshttps://doi.org/10.1007/3-540-61053-7_49openalex-snapshot
Pipelining-dovetailing: A transformation to enhance software pipelining for nested loops
inferred← citeshttps://doi.org/10.1007/3-540-61736-1_43openalex-snapshot
Current status of the SUIF research project
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_38openalex-snapshot
A Polyhedral Approach to Ease the Composition of Program Transformations
inferred← citeshttps://doi.org/10.1007/978-3-540-69501-1_20openalex-snapshot
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations
inferred← citeshttps://doi.org/10.1007/978-3-540-69848-7_69openalex-snapshot
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops
inferred← citeshttps://doi.org/10.1007/bfb0014199openalex-snapshot
A loop parallelization algorithm for HPF compilers
inferred← citeshttps://doi.org/10.1007/bfb0017265openalex-snapshot
Statement-level communication-free partitioning techniques for parallelizing compilers
inferred← citeshttps://doi.org/10.1007/s10559-006-0066-7openalex-snapshot
Optimization of data exchange in parallel computers with distributed memory
inferred← citeshttps://doi.org/10.1007/s10559-012-9382-2openalex-snapshot
Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
inferred← citeshttps://doi.org/10.1007/s10766-004-1460-2openalex-snapshot
Automatic Array Partitioning Based on the Smith Normal Form
inferred← citeshttps://doi.org/10.1007/s10766-006-0012-3openalex-snapshot
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
inferred← citeshttps://doi.org/10.1007/s11227-018-2678-xopenalex-snapshot
Insight into tiles generated by means of a correction technique
inferred← citeshttps://doi.org/10.1016/j.parco.2010.12.005openalex-snapshot
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations
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)00021-0openalex-snapshot
Maximizing parallelism and minimizing synchronization with affine partitions
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00086-1openalex-snapshot
Compilation techniques for parallel systems
inferred← citeshttps://doi.org/10.1023/a:1008112110494openalex-snapshot
Statement-Level Communication-Free Partitioning Techniques for Parallelizing Compilers
inferred← citeshttps://doi.org/10.1023/a:1023857207116openalex-snapshot
Distribution of Operations and Data Arrays over Processors
inferred← citeshttps://doi.org/10.1023/a:1025773814022openalex-snapshot
Mapping of Affine Loop Nests onto Independent Processors
inferred← citeshttps://doi.org/10.1109/asap.1997.606840openalex-snapshot
Automatic data mapping of signal processing applications
inferred← citeshttps://doi.org/10.1109/fccm.2010.45openalex-snapshot
A Comparative Study on the Architecture Templates for Dynamic Nested Loops
inferred← citeshttps://doi.org/10.1109/hicss.1997.667406openalex-snapshot
The alignment problem in a linear algebra framework
inferred← citeshttps://doi.org/10.1109/icpp.1996.538557openalex-snapshot
A compile time partitioning method for DOALL loops on distributed memory systems
inferred← citeshttps://doi.org/10.1109/ispdc.2007.21openalex-snapshot
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework
inferred← citeshttps://doi.org/10.1109/pact.1997.644018openalex-snapshot
Two techniques for static array partitioning on message-passing parallel machines
inferred← citeshttps://doi.org/10.1109/pact.2007.4336220openalex-snapshot
Automatic Correction of Loop Transformations
inferred← citeshttps://doi.org/10.1109/snpd.2015.7176231openalex-snapshot
An Abelian group model of commutative data dependence relations for the iteration space slicing
inferred← citeshttps://doi.org/10.1109/spdp.1995.530708openalex-snapshot
A communication+computation load balanced loop partitioning method
inferred← citeshttps://doi.org/10.1145/1006209.1006244openalex-snapshot
Applications of storage mapping optimization to register promotion
inferred← citeshttps://doi.org/10.1145/1088149.1088169openalex-snapshot
Facilitating the search for compositions of program transformations
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/263699.263719openalex-snapshot
Maximizing parallelism and minimizing synchronization with affine transforms
inferred← citeshttps://doi.org/10.1145/509705.509706openalex-snapshot
Automatic data and computation decomposition on distributed memory parallel computers
inferred← citeshttps://doi.org/10.1145/989393.989437openalex-snapshot
A data locality optimizing algorithm
inferred← citeshttps://doi.org/10.14257/ijgdc.2016.9.11.12openalex-snapshot
A Survey of Loop Parallelization: Models, Approaches, and Recent Developments
inferred← citeshttps://doi.org/10.1515/amcs-2016-0065openalex-snapshot
Tiling arbitrarily nested loops by means of the transitive
inferred← citeshttps://doi.org/10.15407/emodel.44.01.053openalex-snapshot
Use of Loop Transformation Techniques to Optimize Parallel Applications
inferred← citeshttps://doi.org/10.15439/2015f34openalex-snapshot
TRACO: An Automatic Loop Nest Parallelizer for Numerical Applications
inferred← citeshttps://doi.org/10.2495/hpc000191openalex-snapshot
Partitioning And Mapping Nested Loops On Multicomputer
inferred← citeshttps://doi.org/10.3390/electronics13030488openalex-snapshot
GPT-Driven Source-to-Source Transformation for Generating Compilable Parallel CUDA Code for Nussinov’s Algorithm
inferred← citeshttps://doi.org/10.70675/ae2e80ddz5505z493dz8f00zbded07e27060openalex-snapshot
Efficient search-based strategies for polyhedral compilation : algorithms and experience in a production compiler
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.