Sciweavers

Share
ICPP
1991
IEEE

Automatic Parallel Program Generation and Optimization from Data Decompositions

9 years 7 months ago
Automatic Parallel Program Generation and Optimization from Data Decompositions
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel programs based on a separately specified decomposition of the data. To this purpose, programs and data decompositions are expressed in a calculus, called Vcal. It is shown that by rewriting calculus expressions, Single Program Multiple Data (SPMD) code can be generated for shared-memory as well as distributed-memory parallel processors. Optimizations are derived for certain classes of access functions to data structures, subject to block, scatter, and block/scatter decompositions. The presented calculus and transformations are language independent.
Edwin M. R. M. Paalvast, Henk J. Sips, Arjan J. C.
Added 27 Aug 2010
Updated 27 Aug 2010
Type Conference
Year 1991
Where ICPP
Authors Edwin M. R. M. Paalvast, Henk J. Sips, Arjan J. C. van Gemund
Comments (0)
books