Skip to Main content Skip to Navigation
Reports

On the Removal of Anti and Output Dependences

Pierre-Yves Calland 1, 2 Alain Darte 1, 2 Yves Robert 1, 2 Frédéric Vivien 1, 2
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 build upon results of Padua and Wolfe~\cite{PaduaWo86}, who introduce two graph transformations to eliminate anti and output dependences. We first give a unified framework for such transformations. Then, given a loop nest, we aim at determining which statements should be transformed so as to break artificial cycles involving anti or output dependences. The problem of finding the mininum number of statements to be transformed is shown to be NP-complete in the strong sense, and we propose two efficient heuristics.
Document type :
Reports
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/inria-00073890
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:00:09 PM
Last modification on : Friday, June 25, 2021 - 3:40:05 PM

Identifiers

  • HAL Id : inria-00073890, version 1

Collections

Citation

Pierre-Yves Calland, Alain Darte, Yves Robert, Frédéric Vivien. On the Removal of Anti and Output Dependences. [Research Report] RR-2800, LIP RR-1996-04, INRIA, LIP. 1996. ⟨inria-00073890⟩

Share

Metrics

Record views

252

Files downloads

702