The value evolution graph and its use in memory reference analysis Conference Paper

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 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.

name of conference

• 13th International Conference on Parallel Architectures and Compilation Techniques (PACT 2004), 29 September - 3 October 2004, Antibes Juan-les-Pins, France

authors

• Rauchwerger, Lawrence

published proceedings

• Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

author list (cited authors)

• Rus, S., Zhang, D., & Rauchwerger, L.

complete list of authors

• Rus, S||Zhang, D||Rauchwerger, L

publication date

• December 2004

publisher

• IEEE Computer Society  Publisher

published in

• Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT  Journal

Digital Object Identifier (DOI)

• 10.1109/PACT.2004.10004

International Standard Book Number (ISBN) 10

• 0-7695-2229-7

start page

• 243

end page

• 254

URL

• http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9300