Skip to Main content Skip to Navigation

Combining retiming and scheduling techniques for loop parallelization and loop tiling.

Abstract : Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a first step that detects sets of permutable nested loops. All algorithms developed so far consider the statements of the loop body as a single block, in other words, they are not able to take advantage of the structure of dependences between different statements. In this report, we overcome this limitation by showing how the structure of the reduced dependence graph can be taken into account for detecting more permutable loops. Our method combines graph retiming techniques and graph scheduling techniques. It can be viewed as an extension of Wolf and Lam's algorithm to the case of loops with multiple statements. Loop independent dependences play a particular role in our study, and we show how the way we handle them can be useful for fine-grain loop parallelization as well.
Document type :
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:14:38 AM
Last modification on : Tuesday, March 10, 2020 - 12:02:05 PM


Files produced by the author(s)


  • HAL Id : hal-02102115, version 1



Alain Darte, Georges-Andre Silber, Frédéric Vivien. Combining retiming and scheduling techniques for loop parallelization and loop tiling.. [Research Report] LIP RR-1996-34, Laboratoire de l'informatique du parallélisme. 1996, 2+11p. ⟨hal-02102115⟩



Record views


Files downloads