By Topic

Nested loop sequences: towards efficient loop structures in automatic 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

1 Author(s)
Chamski, Z. ; Irisa, Rennes, France

An important problem in automatic parallelization of scientific programs is to generate loops from an algebraic description of the iteration domain. The usual technique is to produce a perfectly nested set of loops, whose bounds consist in maxima and minima of several affine functions. However, perfect loop nests suffer from the run-time overhead of evaluating bound expressions and do not allow to scan non-convex domains efficiently. We study a candidate loop structure for overcoming these problems. This structure, called nested loop sequence (NLS,) is defined as a sequence of DO loops whose bodies ore nonempty sequences of DO loops. We propose on algorithm to compute a NLS scanning a given convex polyhedron, which overcomes the run-time overhead problem. The algorithm produces a loop structure in which the bounds of every loop consist each in a single affine function.<>

Published in:

System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on  (Volume:2 )

Date of Conference:

4-7 Jan. 1994