Skip to Main content Skip to Navigation

How to optimize residual communications ?

Abstract : Minimizing communications when mapping affine loop nests onto distributed memory parallel computers has already drawn a lot of attention. This paper focuses on the next step : as it is generally impossible to obtain a communication-free (or local) mapping, how to optimize the residual communications? We explain how to take advantage of macro-communications such as broadcasts, scatters, gathers or reductions or how to decompose general affine communications into simpler ones that can be performed more efficiently. We finally give a two-step heuristic that summarizes our approach : first minimize the number of nonlocal communications, then optimize residual affine communications using macro-communications or decompositions.
Document type :
Complete list of metadata

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


Files produced by the author(s)


  • HAL Id : hal-02101780, version 1



Michèle Dion, Cyril Randriamaro, Yves Robert. How to optimize residual communications ?. [Research Report] LIP RR-1995-27, Laboratoire de l'informatique du parallélisme. 1995, 2+26p. ⟨hal-02101780⟩



Les métriques sont temporairement indisponibles