inria-00073890, version 1
On the Removal of Anti and Output Dependences
Pierre-Yves Calland 1Alain Darte
a, 1Yves Robert b, 1Frédéric Vivien 1
N° RR-2800 (1996)
Résumé : 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.
- a – CNRS
- b – Ecole Normale Supérieure de Lyon - ENS Lyon
- 1 : REMAP (INRIA Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme)
- INRIA – École Normale Supérieure - Lyon – CNRS : UMR5668 – LIP
- Domaine : Informatique/Autre
- Mots-clés : NODE SPLITTING / ANTI DEPENDENCES / OUTPUT DEPENDENCES / DEPENDENCE GRAPH / NP-COMPLETENESS / HEURISTICS
- Référence interne : RR-2800
- inria-00073890, version 1
- http://hal.inria.fr/inria-00073890
- oai:hal.inria.fr:inria-00073890
- Contributeur : Rapport De Recherche Inria
- Soumis le : Mercredi 24 Mai 2006, 14:00:09
- Dernière modification le : Jeudi 2 Octobre 2008, 16:28:38






Documents associés

Exporter