Non-clairvoyant reduction algorithms for heterogeneous platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Non-clairvoyant reduction algorithms for heterogeneous platforms


We revisit the classical problem of the reduction collective operation in a heterogeneous environment. We discuss and evaluate four algorithms that are non-clairvoyant, i.e., they do not know in advance the computation and communication costs. On the one hand, \bins and \fibo are static algorithms that decide in advance which operations will be reduced, without adapting to the environment; they were originally defined for homogeneous settings. On the other hand, \dyn and \dynnc are fully dynamic algorithms, for commutative or non-commutative reductions. With identical computation costs, we show that these algorithms are approximation algorithms. When costs are exponentially distributed, we perform an analysis of \dyn based on Markov chains. Finally, we assess the relative performance of all four non-clairvoyant algorithms with heterogeneous costs though a set of simulations.
Fichier principal
Vignette du fichier
heteropar.pdf (189.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00926093 , version 1 (09-01-2014)


  • HAL Id : hal-00926093 , version 1


Anne Benoit, Louis-Claude Canon, Loris Marchal. Non-clairvoyant reduction algorithms for heterogeneous platforms. HeteroPar'2013, in conjunction with Euro-Par 2013, Aug 2013, Aachen, Germany. ⟨hal-00926093⟩
221 View
202 Download


Gmail Facebook X LinkedIn More