By Topic

On the complexity of loop fusion

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)
Darte, A. ; Lab. de l''Inf. du Parallelisme, Ecole Normale Superieure de Lyon, France

Loop fusion is a program transformation that combines several loops into one. It is used in parallelizing compilers mainly for increasing the granularity of loops and for improving data reuse. The goal of this paper is to study, from a theoretical point of view, several variants of the loop fusion problem-identifying polynomially solvable cases and NP-complete cases-and to make the link between these problems and some scheduling problems that arise from completely different areas. We study among others, the fusion of loops of different types, and the fusion of loops when combined with loop shifting

Published in:

Parallel Architectures and Compilation Techniques, 1999. Proceedings. 1999 International Conference on

Date of Conference: