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
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102085
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:13:54 AM
Last modification on : Wednesday, November 20, 2019 - 2:54:16 AM

File

RR1995-11.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102085, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

8

Files downloads

14