Automatic array partitioning based on the Smith normal form

DOI10.1007/S10766-004-1460-2MaRDI QIDQ2572380zbMATH OpenOpenAlexFDO

Authors Eric Hung-Yu Tseng, Jean-Luc Gaudiot

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

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

Recommendations

• Algorithms for the computation of the Smith normal form and their implementation on parallel machines
• Efficient array partitioning
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• A parallel algorithm for achieving the Smith Normal Form of an integer matrix
• Partitioning of processor arrays: a piecewise regular approach
• Approximation algorithms for array partitioning problems

Cites work

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

This page was built for publication: Automatic array partitioning based on the Smith normal form

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