An empirical study of Fortran programs for parallelizing compilers
- Changsa Inst. of Tech., Changsa (CN)
- Dept. of Computer Science, York Univ., North York, Ontario M3J 1P3 (CA)
- Illinois Univ., Urbana, IL (USA). Center for Supercomputing Research and Development
In this paper, the authors report some results from an empirical study of program characteristics that are important to parallelizing compiler writers, especially in the area of data dependence analysis and program transformations. The state of the art in data dependence analysis and some parallel execution techniques are also examined. The major findings include: many subscripts contain symbolic terms with unknown values. A few methods to determine their values at compile time are evaluated; array references with coupled subscripts appear quite frequently. These subscripts must be handled simultaneously in a dependence test, rather than being handled separately as in current test algorithms; nonzero coefficients of loop indexes in most subscripts are found to be simple: they are either 1 or -1. It allows an exact real-valued test to be as accurate as an exact integer-valued test for one-dimensional or two-dimensional arrays; dependences with uncertain distance are found to be rather common, and one of the main reasons is the frequent appearance of symbolic terms with unknown values.
- OSTI ID:
- 6445886
- Journal Information:
- IEEE Transactions on Parallel and Distributed Systems; (USA), Vol. 1:3; ISSN 1045-9219
- Country of Publication:
- United States
- Language:
- English
Similar Records
The range test: A dependence test for symbolic, nonlinear expressions
An efficient data dependence analysis for parallelizing compilers