By Topic

Estimating parallel execution time of loops with loop-carried 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
$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

5 Author(s)
Nakanishi, T. ; Graduate Sch. of Inf. Sci., Nara Inst. of Sci. & Technol., Japan ; Joe, K. ; Polychronopoulos, C.D. ; Araki, K.
more authors

We propose a scheme to estimate exact minimum parallel execution time of the single loop with loop-carried dependences in medium and fine grain parallel execution. The minimum parallel execution time of a loop is given by the critical path length of the dependence graph which represents the code obtained from the fully unrolled loop. However, unrolling loops with a large number of iterations requires too much computation time and large storage space to be practical. The scheme proposed provides the minimum parallel execution time without unrolling the loop at all by reducing the problem into an integer linear programming problem and employing the simplex method and a branch-and-bound algorithm to solve it. We also show an experimental implementation of the proposed scheme with Livermore Benchmark Kernels to demonstrate that the computational complexity of our scheme is independent of the number of iterations of the given loop

Published in:

Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on  (Volume:3 )

Date of Conference:

12-16 Aug 1996