Communication-free hyperplane partitioning of nested loops

DOI10.1006/JPDC.1993.1094MaRDI QIDQ1309214zbMATH OpenOpenAlexFDO

Authors Chua-Huang Huang, P. Sadayappan

Publication date 20 December 1993

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1993.1094

zbMATH Keywords

partitioningnested loops

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computer system organization (68M99)

Recommendations

• Communication-Minimal Partitioning and Data Alignment for Affine Nested Loops
• Partitioning and mapping nested loops on multicomputers
• scientific article; zbMATH DE number 1442017
• scientific article; zbMATH DE number 5353986
• Deterministic Parallel Hypergraph Partitioning
• A hybrid scheme for efficiently executing nested loops on multiprocessors
• COMPILE TIME PARTITIONING OF NESTED LOOP ITERATION SPACES WITH NON-UNIFORM DEPENDENCES*

Cited in

(4)

• Memetic algorithms for parallel code optimization
• A computation + communication load balanced loop partitioning method for distributed memory systems
• Communication-free alignment for array references with linear subscripts in three loop index variables or quadratic subscripts
• Statement-level communication-free partitioning techniques for parallelizing compilers

This page was built for publication: Communication-free hyperplane partitioning of nested loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309214)