Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation

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 :
Complete list of metadata

Cited literature [40 references]  Display  Hide  Download
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:08:55 AM
Last modification on : Wednesday, March 9, 2022 - 12:08:06 PM


Files produced by the author(s)


  • HAL Id : hal-02101883, version 1



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⟩



Record views


Files downloads