Constraint based vectorization

Authors:
Brian D. Koblenz;William B. Noyce
Affiliations:
Digital Equipment Corporation;Digital Equipment Corporation
Venue:
ICS '89 Proceedings of the 3rd international conference on Supercomputing
Year:
1989

Citing 7
Cited 0

Advanced compiler optimizations for supercomputers

Communications of the ACM - Special issue on parallelism
A vectorizing Fortran compiler

IBM Journal of Research and Development
The program dependence graph and its use in optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic translation of FORTRAN programs to vector form

ACM Transactions on Programming Languages and Systems (TOPLAS)
The parallel execution of DO loops

Communications of the ACM
Structure of Computers and Computations

Structure of Computers and Computations
Dependence analysis for subscripted variables and its application to program transformations

Dependence analysis for subscripted variables and its application to program transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

The constraint tree provides a uniform framework for representing many loop transformations. It allows us to estimate the performance of several alternative execution methods before committing to any of the transformations.We introduce the constraint tree, show how it is built, and demonstrate its use for vectorization and parallel decomposition. We show how unconstrained loops can be moved to reduce the costs of memory accesses.