By Topic

An optimized dependence convex hull partitioning technique to maximize parallelism of nested loops with non-uniform dependences

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
$33 $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)
Der-Lin Pean ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Guan-Joe Lai ; Cheng Chen

There are many methods existing for nested loop partitioning; however, most of them perform poorly when partitioning loops with non-uniform dependences. This paper proposes a generalized and optimized loop partitioning mechanism to exploit parallelism from nested loops with non-uniform dependences. Our approach, based on dependence convex theory, divides a loop into variable-size partitions. Furthermore, the proposed algorithm partitions a nested loop by using the copy-renaming and optimized partitioning techniques in order to minimize the number of parallel regions of the iteration space, outperforming other previous mechanisms for partitioning nested loops with non-uniform dependences

Published in:

Parallel and Distributed Systems, 2000. Proceedings. Seventh International Conference on

Date of Conference: