By Topic

Profiling dependence vectors for loop parallelization

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

3 Author(s)
Shaw-Yen Tseng ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Chung-Ta King ; Chuan-Yi Tang

A dependence relation between two data references is linear if it generates dependence vectors that are linear functions of the loop indices. A linear dependence relation often induces a large number of dependence vectors. Empirical studies also show that linear dependencies often intermix with uniform dependencies in loops. These factors make it difficult to analyze such loops and extract the inherit parallelism. In this paper we propose to manipulate such dependencies in the dependence vector space and summarize the large number of dependence vectors with their convex hull. The convex hull, as a profile of the dependence vectors, can be used to deduce many important properties of the vectors. We will show how to find the convex hull and then apply it to loop parallelization. The proposed approach is compared with other schemes

Published in:

Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International

Date of Conference:

15-19 Apr 1996