DMCA
Maximizing Parallelism and Minimizing Synchronization with Affine Transforms (1997)
Cached
Download Links
- [suif.stanford.edu]
- [suif.stanford.edu]
- [suif.stanford.edu]
- [www-suif.stanford.edu]
- [suif.stanford.edu]
- [saluc.engr.uconn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Parallel Computing |
| Citations: | 147 - 6 self |
BibTeX
@INPROCEEDINGS{Lim97maximizingparallelism,
author = {Amy W. Lim and Monica S. Lam},
title = {Maximizing Parallelism and Minimizing Synchronization with Affine Transforms},
booktitle = {Parallel Computing},
year = {1997},
pages = {201--214},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents the first algorithm to find the optimal affine transform that maximizes the degree of parallelism while minimizing the degree of synchronization in a program with arbitrary loop nestings and affine data accesses. The problem is formulated without the use of imprecise data dependence abstractions such as data dependence vectors. The algorithm presented subsumes previously proposed program transformation algorithms that are based on unimodular transformations, loop fusion, fission, scaling, reindexing and/or statement reordering. 1 Introduction As multiprocessors become popular, it is important to develop compilers that can automatically translate sequential programs into efficient parallel code. Getting high performance on a multiprocessor requires not only finding parallelism in the program but also minimizing the synchronization overhead. Synchronization is expensive on a multiprocessor. The cost of synchronization goes far beyond just the operations that manipul...
Keyphrases
affine transforms minimizing synchronization synchronization overhead loop fusion arbitrary loop nestings imprecise data dependence abstraction first algorithm optimal affine transform efficient parallel code data access high performance program transformation data dependence vector sequential program statement reordering unimodular transformation
