loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th International Conference on Parallel Architecture and Compilation Techniques (PACT'04)
The Value Evolution Graph and its Use in Memory Reference Analysis
Antibes Juan-les-Pins, France
September 29-October 03
ISBN: 0-7695-2229-7
Silvius Rus, Texas A&M University
Dongmin Zhang, Texas A&M University
Lawrence Rauchwerger, Texas A&M University
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 values taken by induction variable with and without closed forms. 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 addressed 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.
Citation:
Silvius Rus, Dongmin Zhang, Lawrence Rauchwerger, "The Value Evolution Graph and its Use in Memory Reference Analysis," pact, pp.243-254, 13th International Conference on Parallel Architecture and Compilation Techniques (PACT'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.