Automatic Mapping of System of N-Dimensional Affine Recurrence Equations (SARE) onto Distributed Memory Parallel Systems

Authors:
Alessandro Marongiu;Paolo Palazzari
Affiliations:
Univ. “La Sapienza”, Rome, Italy;Casaccia-HPCN Project, Rome, Italy
Venue:
IEEE Transactions on Software Engineering - Special issue on architecture-independent languages and software tools for parallel processing
Year:
2000

Citing 18
Cited 3

Theory of linear and integer programming

Theory of linear and integer programming
Synthesizing Linear Array Algorithms from Nested FOR Loop Algorithms

IEEE Transactions on Computers
Global optimization and simulated annealing

Mathematical Programming: Series A and B
Some efficient solutions to the affine scheduling problem: I. One-dimensional time

International Journal of Parallel Programming
Geometrical tools to map systems of affine recurrence equations on regular arrays

Acta Informatica
Affine-by-statement scheduling of uniform and affine loop nests over parametric domains

Journal of Parallel and Distributed Computing
Linear mappings of n-dimensional uniform recurrences onto k-dimensional systolic arrays

Journal of VLSI Signal Processing Systems
A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP

Journal of VLSI Signal Processing Systems
Parameterized polyhedra and their vertices

International Journal of Parallel Programming
Automatic storage management for parallel programs

Parallel Computing - Special issues on languages and compilers for parallel computers
The parallel execution of DO loops

Communications of the ACM
A toolbox for affine recurrence equations parallelization

HPCN Europe '95 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
A Singular Loop Transformation Framework Based on Non-Singular Matrices

Proceedings of the 5th International Workshop on Languages and Compilers for Parallel Computing
Solutions to the Communication Minimization Problem for Affine Recurrence Equations

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Loop Parallelization in the Polytope Model

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Automatic Parallelization in the Polytope Model

The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications
OPERA: a toolbox for loop parallelization

Proceedings of the First IFIP TC10 International Workshop on Software Engineering for Parallel and Distributed Systems
Parametric Analysis of Polyhedral Iteration Spaces

ASAP '96 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors

Parallel dedicated hardware devices for heterogeneous computations

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
High Level Software Synthesis of Affine Iterative Algorithms onto Parallel Architectures

HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
High Level Synthesis for Programmable Devices: The HADES Project

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automatic extraction of parallelism from algorithms, and the consequent parallel code generation, is a challenging problem. In this work, we present a procedure for automatic parallel code generation in the case of algorithms described through Set of Affine Recurrence Equations (SARE); starting from the original SARE description in an N-dimensional iteration space, the algorithm is converted into a parallel code for an (eventually virtual) m-dimensional distributed memory parallel machine ($m