Skip to Main content Skip to Navigation
Reports

Plugging Anti and Output Dependence Removal Techniques into Loop Parallelization Algorithms

Pierre-Yves Calland 1 Alain Darte 1 Yves Robert 1 Frédéric Vivien 1
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In this paper we shortly survey some loop transformation techniques which break anti or output dependences, or artificial cycles involving such «false» dependences. These false dependences are removed through the introduction of temporary buffer arrays. Next we show how to plug these techniques into loop parallelization algorithms (such as Allen and Kennedy's algorithm). The goal is to extract as many parallel loops as the intrinsic degree of parallelism of the nest authorizes, while avoiding a full memory expansion. We try to reduce the number of temporary arrays that we introduce, as well as their dimension.
Document type :
Reports
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/inria-00073783
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:45:01 PM
Last modification on : Monday, November 16, 2020 - 9:56:02 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:07:16 PM

Identifiers

  • HAL Id : inria-00073783, version 1

Collections

Citation

Pierre-Yves Calland, Alain Darte, Yves Robert, Frédéric Vivien. Plugging Anti and Output Dependence Removal Techniques into Loop Parallelization Algorithms. [Research Report] RR-2914, INRIA. 1996. ⟨inria-00073783⟩

Share

Metrics

Record views

254

Files downloads

627