On the public citation graph

Mapping affine loop nests: New results

https://doi.org/10.1007/bfb0046628
0 signed · 43 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/bfb0046628openalex-snapshot
Mapping affine loop nests: New results
inferredcites →https://doi.org/10.1016/0167-8191(94)90001-9openalex-snapshot
Mapping uniform loop nests onto distributed memory architectures
inferredcites →https://doi.org/10.1016/0743-7315(91)90090-vopenalex-snapshot
The data alignment phase in compiling programs for distributed-memory machines
inferredcites →https://doi.org/10.1109/71.308531openalex-snapshot
Communication-free data allocation techniques for parallelizing compilers on multicomputers
inferredcites →https://doi.org/10.1109/asap.1994.331782openalex-snapshot
Data alignment of loop nests without nonlocal communications
inferredcites →https://doi.org/10.1142/s0129626494000235openalex-snapshot
TOWARD AUTOMATIC DISTRIBUTION
inferredcites →https://doi.org/10.1142/s0129626494000259openalex-snapshot
ON THE ALIGNMENT PROBLEM
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/173262.155101openalex-snapshot
Global optimizations for parallelism and locality on scalable parallel machines

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.772openalex-snapshot
Space–time mapping and tiling: a helpful combination
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0139openalex-snapshot
Compiling Affine Nested Loops: How to Optimize the Residual Communications after the Alignment Phase
inferred← citeshttps://doi.org/10.1007/11532378_9openalex-snapshot
A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces
inferred← citeshttps://doi.org/10.1007/11596110_2openalex-snapshot
Forward Communication Only Placements and Their Use for Parallel Program Construction
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_52openalex-snapshot
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_14openalex-snapshot
Application of the Polytope Model to Functional Programs
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-61142-8_610openalex-snapshot
Affine data mapping with residual communication optimization: Evaluation of heuristics
inferred← citeshttps://doi.org/10.1007/3-540-61142-8_627openalex-snapshot
Bouclettes: A Fortran loop parallelizer
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_60openalex-snapshot
Solving the constant-degree parallelism alignment problem
inferred← citeshttps://doi.org/10.1007/3-540-61736-1_44openalex-snapshot
Automatic parallelization in the polytope model
inferred← citeshttps://doi.org/10.1007/978-1-4757-3155-2_9openalex-snapshot
Symbolic Scheduling of Parameterized Task Graphs on Parallel Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-25935-0_5openalex-snapshot
Program Optimization in the Domain of High-Performance Parallelism
inferred← citeshttps://doi.org/10.1007/bfb0002752openalex-snapshot
Solutions to the communication minimization problem for affine recurrence equations
inferred← citeshttps://doi.org/10.1007/bfb0017283openalex-snapshot
The loop parallelizer LooPo—announcement
inferred← citeshttps://doi.org/10.1007/bfb0031654openalex-snapshot
Combining inter- and intradimensional alignment analysis to support data distribution
inferred← citeshttps://doi.org/10.1007/bfb0037202openalex-snapshot
Interprocedural array alignment analysis
inferred← citeshttps://doi.org/10.1007/s11227-006-6615-zopenalex-snapshot
An Efficient Communication Scheduling Method for the Processor Mapping Technique Applied Data Redistribution
inferred← citeshttps://doi.org/10.1007/s11227-007-0166-9openalex-snapshot
A flexible processor mapping technique toward data localization for block-cyclic data redistribution
inferred← citeshttps://doi.org/10.1007/s11227-009-0280-yopenalex-snapshot
Communication-free data alignment for arrays with exponential references in parallelizing compilers for scalable parallel systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.05.001openalex-snapshot
Compact DAG representation and its symbolic scheduling
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.09.012openalex-snapshot
Quantifier elimination in automatic loop parallelization
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(99)00063-0openalex-snapshot
Termination detection in parallel loop nests with while loops
inferred← citeshttps://doi.org/10.1023/a:1007559710855openalex-snapshot
Communication Optimization for Affine Recurrence Equations Using Broadcast and Locality
inferred← citeshttps://doi.org/10.1023/a:1025165407063openalex-snapshot
Affine Dependence Classification for Communications Minimization
inferred← citeshttps://doi.org/10.1109/hicss.1997.667406openalex-snapshot
The alignment problem in a linear algebra framework
inferred← citeshttps://doi.org/10.1109/ipps.1996.508085openalex-snapshot
How to optimize residual communications?
inferred← citeshttps://doi.org/10.1109/pact.1996.552656openalex-snapshot
A heuristic approach for finding a solution to the constant-degree parallelism alignment problem
inferred← citeshttps://doi.org/10.1109/tpds.2004.1264783openalex-snapshot
Using elementary linear algebra to solve data alignment for arrays with linear or quadratic references
inferred← citeshttps://doi.org/10.1145/1065944.1065962openalex-snapshot
A novel approach for partitioning iteration spaces with variable densities
inferred← citeshttps://doi.org/10.1145/330560.330965openalex-snapshot
A group theoretic approach to data and code partitioning
inferred← citeshttps://doi.org/10.1145/354880.354886openalex-snapshot
A preprocessing step for global loop transformations for data transfer optimization
showing the first 33 of 34 · page through all 34
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.