On the public citation graph

Communication-free hyperplane partitioning of nested loops

https://doi.org/10.1007/bfb0038665
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/bf00128175openalex-snapshot
Compiling programs for distributed-memory multiprocessors
inferredcites →https://doi.org/10.1007/bf00128176openalex-snapshot
Compiling parallel programs by optimizing performance
inferredcites →https://doi.org/10.1007/bfb0038665openalex-snapshot
Communication-free hyperplane partitioning of nested loops
inferredcites →https://doi.org/10.1016/0743-7315(90)90086-5openalex-snapshot
Data optimization: Allocation of arrays to reduce communication on SIMD machines
inferredcites →https://doi.org/10.1109/71.97903openalex-snapshot
Compile-time techniques for data distribution in distributed memory machines
inferredcites →https://doi.org/10.1109/dmcc.1991.633082openalex-snapshot
Automatic Data Partitioning on Distributed Memory Multiprocessors
inferredcites →https://doi.org/10.1109/fmpc.1990.89493openalex-snapshot
Index domain alignment: minimizing cost of cross-referencing between distributed arrays
inferredcites →https://doi.org/10.1145/318789.318808openalex-snapshot
Array distribution in SUPERB
inferredcites →https://doi.org/10.1145/73141.74824openalex-snapshot
Process decomposition through locality of reference
inferredcites →https://doi.org/10.1145/99163.99183openalex-snapshot
Supporting shared data structures on distributed memory architectures
inferredcites →https://doi.org/10.1145/99164.99183openalex-snapshot
Supporting shared data structures on distributed memory architectures

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.0139openalex-snapshot
Compiling Affine Nested Loops: How to Optimize the Residual Communications after the Alignment Phase
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_8openalex-snapshot
Alignment Problem
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_11openalex-snapshot
Solving Alignment Using Elementary Linear Algebra
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_48openalex-snapshot
Load balanced optimisation of virtualised algorithms for implementation on massively parallel SIMD architectures
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_28openalex-snapshot
Loop parallelization in the polytope model
inferred← citeshttps://doi.org/10.1007/3-540-57981-8_159openalex-snapshot
Parallelizing compilers: what can be achieved?
inferred← citeshttps://doi.org/10.1007/3-540-58430-7_62openalex-snapshot
Evaluating array expressions on massively parallel machines with communication/computation overlap
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-61626-8_60openalex-snapshot
Solving the constant-degree parallelism alignment problem
inferred← citeshttps://doi.org/10.1007/bfb0025870openalex-snapshot
Solving alignment using elementary linear algebra
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90001-9openalex-snapshot
Mapping uniform loop nests onto distributed memory architectures
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90026-jopenalex-snapshot
SPMD execution of programs with pointer-based data structures on distributed-memory machines
inferred← citeshttps://doi.org/10.1016/b978-044482106-5/50028-4openalex-snapshot
Heuristics for Evaluation of Array Expressions on State of the Art Massively Parallel Machines
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00049-xopenalex-snapshot
Mapping affine loop nests
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00022-2openalex-snapshot
Interprocedural analysis for loop scheduling and data allocation
inferred← citeshttps://doi.org/10.1023/a:1025165407063openalex-snapshot
Affine Dependence Classification for Communications Minimization
inferred← citeshttps://doi.org/10.1109/82.625008openalex-snapshot
Minimization of memory access overhead for multidimensional DSP applications via multilevel partitioning and scheduling
inferred← citeshttps://doi.org/10.1109/asap.1993.397116openalex-snapshot
Communication-minimal mapping of uniform loop nests onto distributed memory architectures
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.1145/155090.155101openalex-snapshot
Global optimizations for parallelism and locality on scalable parallel machines
inferred← citeshttps://doi.org/10.1145/224170.224500openalex-snapshot
A novel approach towards automatic data distribution
inferred← citeshttps://doi.org/10.1145/291891.291901openalex-snapshot
Automatic data layout for distributed-memory machines
inferred← citeshttps://doi.org/10.1145/330560.330965openalex-snapshot
A group theoretic approach to data and code partitioning
inferred← citeshttps://doi.org/10.1177/109434209500900303openalex-snapshot
Evaluating Array Expressions On Massively Parallel Machines With Communication/ Computation Overlap
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.1407openalex-snapshot
Compiler Optimization Techniques for Scheduling and Reducing Overhead
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.6181openalex-snapshot
Automatic Data and Computation Mapping for Distributed-Memory Machines.
inferred← citeshttps://doi.org/10.5555/224659.224723openalex-snapshot
Mappings for communication minimization using distribution and alignment
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93296openalex-snapshot
Automatic data distribution for massively parallel processors
showing the first 30 of 31 · page through all 31
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.