Work

Maximizing parallelism and minimizing synchronization with affine transforms

Year: 1997
Type: conference-paper
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.
Institution: Stanford University
Language: English
Open Access status: bronze
OpenAlex ID: W2038543880
FWCI: 5.661
Cites: 23
Cited by: 198
Related to: 10