Automatic array partitioning based on the Smith normal form

DOI10.1007/s10766-004-1460-2zbMath1101.68592OpenAlexW2018208939MaRDI QIDQ2572380

Jean-Luc Gaudiot, Eric Hung-Yu Tseng

Publication date: 16 November 2005

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10766-004-1460-2

zbMATH Keywords

data partitioningcommunication optimizationparallel loopSmith-normal-form

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Efficient computation of address sequences in data parallel programs using closed forms for basis vectors.
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Mapping affine loop nests
• Generating local addresses and communication sets for data-parallel programs
• The Structure of Periodic Storage Schemes for Parallel Memories