Mapping of Affine Loop Nests onto Independent Processors

Authors:
N. A. Likhoded
Affiliations:
Institute of Mathematics, National Academy of Sciences of Belarus, Minsk, Belarus
Venue:
Cybernetics and Systems Analysis
Year:
2003

Citing 6
Cited 0

Independent Partitioning of Algorithms with Uniform Dependencies

IEEE Transactions on Computers
Global optimizations for parallelism and locality on scalable parallel machines

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Communication-free hyperplane partitioning of nested loops

Journal of Parallel and Distributed Computing
Maximizing parallelism and minimizing synchronization with affine partitions

Parallel Computing - Special issues on languages and compilers for parallel computers
Communication-Free Parallelization via Affine Transformations

LCPC '94 Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing
Solving Alignment Using Elementary Linear Algebra

LCPC '94 Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method is given for obtaining independent parts of algorithms, represented by affine loop nests (not necessary perfectly nested). The method is based on a modular affine mapping of algorithm operations onto independent virtual processors. The method can select more independent computations than the known procedures based on affine mappings.