Skip to Main content Skip to Navigation
New interface
Reports (Research report)

A comparison of nested loops parallelization algorithms.

Abstract : In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorithm, Wolf and Lam's algorithm and Darte and Vivien's algorithm) that use different representations of distance vectors as input. We identify the concepts that make them similar or different. We study the optimality of each with respect to the dependence analysis it uses. We propose well-chosen examples that illustrate the power and limitations of the three algorithms. This study permits to identify which algorithm is the most suitable for a given representation of dependences.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:13:54 AM
Last modification on : Wednesday, October 26, 2022 - 8:14:34 AM


Files produced by the author(s)


  • HAL Id : hal-02102085, version 1



Alain Darte, Frédéric Vivien. A comparison of nested loops parallelization algorithms.. [Research Report] LIP RR-1995-11, Laboratoire de l'informatique du parallélisme. 1995, 2+18p. ⟨hal-02102085⟩



Record views


Files downloads