Skip to Main content Skip to Navigation

Alignment and distribution is NOT (always) NP-hard.

Abstract : In this paper, an efficient algorithm to simultaneously implement array alignment and data/computation distribution is introduced and evaluated. We re-visit previous work of Li and Chen, and we show that their alignment step should not be conducted without preserving the potential parallelism. In other words, the optimal alignment may well sequentialize computations, whatever the distribution afterwards. We provide an efficient algorithm that handles alignment and data/computation distribution simultaneously. The good news is that several important instances of the whole alignment/distribution problem have polynomial complexity, while alignment itself is NP-complete.
Document type :
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Colette Orange Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:11:33 AM
Last modification on : Saturday, September 11, 2021 - 3:19:16 AM


Files produced by the author(s)


  • HAL Id : hal-02101994, version 1



Vincent Boudet, Fabrice Rastello, Yves Robert. Alignment and distribution is NOT (always) NP-hard.. [Research Report] LIP RR-1998-30, Laboratoire de l'informatique du parallélisme. 1998, 2+18p. ⟨hal-02101994⟩



Les métriques sont temporairement indisponibles