Abstract
We present a new approach to dependence testing in the presence of induction variables. Instead of looking for closed form expressions, our method computes monotonic evolution which captures the direction in which the value of a variable changes. This information is then used in the dependence test to help determine whether array references are dependence-free. Under this scheme, closed form computation and induction variable substitution can be delayed until after the dependence test and be performed on-demand. To improve computative efficiency, we also propose an optimized (non-iterative) data-flow algorithm to compute evolution. Experimental results show that dependence tests based on evolution information matches the accuracy of that based on closed-form computation (implemented in Polaris), and when no closed form expressions can be calculated, our method is more accurate than that of Polaris.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the International Conference on Supercomputing |
| Pages | 78-91 |
| Number of pages | 14 |
| State | Published - 2001 |
| Event | 2001 International Conference on Supercomputing - Sorento, Italy Duration: Jun 17 2001 → Jun 21 2001 |
Other
| Other | 2001 International Conference on Supercomputing |
|---|---|
| Country/Territory | Italy |
| City | Sorento |
| Period | 6/17/01 → 6/21/01 |
ASJC Scopus subject areas
- Computer Science(all)