On the Removal of Anti and Output DependencesReport as inadecuate




On the Removal of Anti and Output Dependences - Download this document for free, or read online. Document in PDF available to download.

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.

Mots-clés : HEURISTICS OUTPUT DEPENDENCES DEPENDENCE GRAPH NP-COMPLETENESS NODE SPLITTING ANTI DEPENDENCES





Author: Pierre-Yves Calland - Alain Darte - Yves Robert - Frédéric Vivien -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents