Loop parallelization algorithms : from parallelism extraction to code generation.

Abstract : In this paper, we survey loop parallelization algorithms, analyzing the dependence representations they use, the loop transformations they generate, the code generation schemes they require, and their ability to incorporate various optimizing criteria such as maximal parallelism detection, detection of permutable loops , minimization of synchronizations, easiness of code generation, etc. We complete the discussion by presenting new results related to code generation and loop fusion for a particular class of multi-dimensional schedules, called shifted linear schedules. We demonstrate that algorithms based on such schedules, while generally considered as too complex, can indeed lead to simple codes.
Document type :
Reports
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101883
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:08:55 AM
Last modification on : Tuesday, June 4, 2019 - 4:24:04 PM

File

RR1997-17.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101883, version 1

Collections

Citation

Pierre Boulet, Alain Darte, Georges-Andre Silber, Frédéric Vivien. Loop parallelization algorithms : from parallelism extraction to code generation.. [Research Report] LIP RR-1997-17, Laboratoire de l'informatique du parallélisme. 1997, 2+30p. ⟨hal-02101883⟩

Share

Metrics

Record views

6

Files downloads

24