Automatic Parallelization Using the Value Evolution Graph Conference Paper uri icon

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. © Springer-Verlag Berlin Heidelberg 2005.

name of conference

  • Languages and Compilers for High Performance Computing, 17th International Workshop, LCPC 2004, West Lafayette, IN, USA, September 22-24, 2004, Revised Selected Papers

published proceedings

  • LANGUAGES AND COMPILERS FOR HIGH PERFORMANCE COMPUTING

author list (cited authors)

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

citation count

  • 0

complete list of authors

  • Rus, Silvius||Zhang, Dongmin||Rauchwerger, Lawrence

editor list (cited editors)

  • Eigenmann, R., Li, Z., & Midkiff, S. P.

publication date

  • January 2005