Maximizing parallelism and minimizing synchronization with affine partitions

This paper presents an algorithm to find the optimal affine partitions that maximize the degree of parallelism and minimize the degree of synchronization in programs with arbitrary loop nestings and affine data accesses. The problem is formulated without the use of imprecise data dependence abstract...

Full description

Saved in:
Bibliographic Details
Published inParallel computing Vol. 24; no. 3; pp. 445 - 475
Main Authors Lim, Amy W., Lam, Monica S.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.1998
Subjects
Affine partitions
Affine transforms
Coarse granularity
Multiprocessors
Parallelism
Parallelizing compilers
Synchronization
Multiprocessors
Affine transforms
Parallelism
Parallelizing compilers
Affine partitions
Synchronization
Coarse granularity
Online AccessGet full text

Cover

More Information
Summary:This paper presents an algorithm to find the optimal affine partitions that maximize the degree of parallelism and minimize the degree of synchronization in programs 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 loop transformation algorithms that are based on unimodular transformations, loop distribution, fusion, scaling, reindexing, and statement reordering.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-8191
1872-7336
DOI:10.1016/S0167-8191(98)00021-0