By Topic

Discovering Maximum Parallelization Using Advanced Data Dependence Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Birch, J. ; Dept. of Comput. Sci., Univ. of Texas at San Antonio, San Antonio, TX ; Psarris, K.

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.

Published in:

High Performance Computing and Communications, 2008. HPCC '08. 10th IEEE International Conference on

Date of Conference:

25-27 Sept. 2008