This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth International Conference on Parallel Architectures and Compilation Techniques (PACT'99)
On the Complexity of Loop Fusion
Newport Beach, California
October 12-October 16
ISBN: 0-7695-0425-6
Alain Darte, ?cole Normale Sup?rieure de Lyon
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.
Index Terms:
parallelization, loop fusion, loop distribution, complexity
Citation:
Alain Darte, "On the Complexity of Loop Fusion," pact, pp.149, Eighth International Conference on Parallel Architectures and Compilation Techniques (PACT'99), 1999
Usage of this product signifies your acceptance of the Terms of Use.