On the removal of anti- and output-dependences - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Parallel Programming Year : 1998

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.

Dates and versions

hal-00856847 , version 1 (02-09-2013)

Identifiers

Cite

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⟩
85 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More