Skip to Main content Skip to Navigation
New interface
Journal articles

On the removal of anti- and output-dependences

Abstract : In this paper we build upon results of Padua and Wolfe, who introduced two graph transformations to break dependence paths including anti- and output-dependences. We first formalize these two transformations. Then, given a loop nest, we aim at determining which statements should be transformed so as to break artificial dependence paths involving anti- or output-dependences. The problem of finding the minimum number of statements to be transformed is shown to be NP-complete, and we propose two efficient heuristics.
Complete list of metadata
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Monday, September 2, 2013 - 4:04:50 PM
Last modification on : Tuesday, October 25, 2022 - 4:19:55 PM

Links full text




Pierre-Yves Calland, Alain Darte, Yves Robert, Frédéric Vivien. On the removal of anti- and output-dependences. International Journal of Parallel Programming, 1998, 26 (3), pp.285-312. ⟨10.1023/A:1018790129478⟩. ⟨hal-00856847⟩



Record views