Authors: Silvius Rus, Dongmin Zhang, Lawrence Rauchwerger

Venue: Languages and Compilers for High Performance Computing (LCPC)
DOI: 10.1007/11532378_27
Link to Publication

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. 

@InProceedings{10.1007/11532378_27,

author=\"Rus, Silvius

and Zhang, Dongmin

and Rauchwerger, Lawrence\",

editor=\"Eigenmann, Rudolf

and Li, Zhiyuan

and Midkiff, Samuel P.\",

title=\"Automatic Parallelization Using the Value Evolution Graph\",

booktitle=\"Languages and Compilers for High Performance Computing\",

year=\"2005\",

publisher=\"Springer Berlin Heidelberg\",

address=\"Berlin, Heidelberg\",

pages=\"379--393\",

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.\",

isbn=\"978-3-540-31813-2\"

}