On the Complexity of Loop Fusion

@inproceedings{Darte1999OnTC,
  title={On the Complexity of Loop Fusion},
  author={Alain Darte},
  booktitle={IEEE PACT},
  year={1999}
}
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… CONTINUE READING
Highly Cited
This paper has 112 citations. REVIEW CITATIONS

Topics

Statistics

01020'01'03'05'07'09'11'13'15'17
Citations per Year

113 Citations

Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.