Abstract
We introduce a framework for the analysis of memory reference sets addressed by induction variables without closed forms. This framework relies on a new data structure, the Value Evolution Graph (VEG), which models the global flow of scalar and array values within a program. We describe the application of our framework to array data-flow analysis, privatization, and dependence analysis. This results in the automatic parallelization of loops that contain arrays indexed by induction variables without closed forms. We implemented this framework in the Polaris research compiler. We present experimental results on a set of codes from the PERFECT, SPEC, and NCSA benchmark suites.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 379-393 |
| Number of pages | 15 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3602 |
| DOIs | |
| State | Published - 2005 |
| Externally published | Yes |
| Event | 17th International Workshop on Languages and Compilers for High Performance Computing, LCPC 2004 - West Lafayette, IN, United States Duration: Sep 22 2004 → Sep 24 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science