Discovering Maximum Parallelization Using Advanced Data Dependence Analysis

Accurate data dependence testing allows a compiler to perform safe automatic code optimization and parallelization. It has been shown that factors, such as loop variants and nonlinear expressions, limit opportunity for data dependence testing and parallelization. Recently, the NLVI-Test has been int...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2008 10th IEEE International Conference on High Performance Computing and Communications : 25-27 September 2008 s. 103 - 112
Hlavní autori: Birch, J., Psarris, K.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2008
Predmet:
Arrays
Automatic Parallelization
Benchmark testing
Chromium
Compiler Optimizations
Dependence Analysis
Equations
Indexes
Induction Variable Substitution
Mathematical model
Program Analysis
Testing
ISBN:0769533523, 9780769533520
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Accurate data dependence testing allows a compiler to perform safe automatic code optimization and parallelization. It has been shown that factors, such as loop variants and nonlinear expressions, limit opportunity for data dependence testing and parallelization. Recently, the NLVI-Test has been introduced as new technology to enable exact data dependence testing on nonlinear expressions. Apart from this work, analyses that utilize the Chains of Recurrences formalism have been shown to boost a dependence test's ability to analyze expressions. In this paper we present techniques for applying the NLVI-Test ideas in conjunction with Chains of Recurrences analysis, to couple the benefits of both. In addition, we develop a "Parallelization Index" which describes the upper bound of the total parallelization obtainable for our compiler infrastructure. We perform an experimental evaluation of our efforts on scientific benchmarks. Results show our techniques result in higher numbers of total parallel loops discovered, and moreover, that we consistently expose a majority of the parallelism obtainable.
ISBN:0769533523
9780769533520
DOI:10.1109/HPCC.2008.145