Deriving Good Transformations for Mapping Nested Loops on Hierarchical Parallel Machines in Polynomial Time (1992)
| Citations: | 15 - 9 self |
BibTeX
@MISC{Kumar92derivinggood,
author = {K.G. Kumar and D. Kulkarni and A. Basu},
title = {Deriving Good Transformations for Mapping Nested Loops on Hierarchical Parallel Machines in Polynomial Time},
year = {1992}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a computationally efficient method for deriving the most appropriate transformation and mapping of a nested loop for a given hierarchical parallel machine. This method is in the context of our systematic and general theory of unimodular loop transformations for the problem of iteration space partitioning [7]. Finding an optimal mapping or an optimal associated unimodular transformation is NP-complete. We present a polynomial time method for obtaining a `good' transformation using a simple parameterized model of the hierarchical machine. We outline a systematic methodology for obtaining the most appropriate mapping. 1 Introduction Efficient execution of many programs on parallel machines demands a methodology for partitioning the iteration spaces of the nested loops that form the core of their computations. Most existing approaches treat transformations like loop interchange (permutation), outer and inner loop parallelization, reversal etc. independently. Only recently have ...
Citations
No citations identified.
