By Topic

A loop parallelization method for 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

2 Author(s)
Chul-Kwon Cho ; Agency for Defense Dev., Taejon, South Korea ; Mann-Ho Lee

This paper proposes an efficient method of partitioning nested loops with non-uniform dependences for maximizing parallelism. Our approach is based on convex hull theory, and it will divide the iteration space of the loop into three regions as two parallel regions where the iterations can be fully executed in parallel and one parallelizable region where the iterations are inherently serial, but possible parallelism can be exploited. And in order to maximize parallelism from the parallelizable region, an algorithm using integer programming which partitions a loop into variable size partitions is also proposed. In comparison with some works on partitioning, the proposed method is a simple and exact partitioning method, and it gives much better speedup and extracts more parallelism than them

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997