Skip to Main content Skip to Navigation

Determining the optimal redistribution

Abstract : The classical redistribution problem aims at optimally scheduling communications when moving from an initial data distribution \Dini to a target distribution \Dtar where each processor $P_{i}$ will host a subset $P(i)$ of data items. However, modern computing platforms are equipped with a powerful interconnection switch, and the cost of a given communication is (almost) independent of the location of its sender and receiver. This leads to generalizing the redistribution problem as follows: find the optimal permutation $\sigma$ of processors such that $P_{i}$ will host the set $P(\sigma(i))$, and for which the cost of the redistribution is minimal. This report studies the complexity of this generalized problem. We provide optimal algorithms and evaluate their gain over classical redistribution through simulations. We also show the NP-hardness of the problem to find the optimal data partition and processor permutation (defined by new subsets $P(\sigma(i))$) that minimize the cost of redistribution followed by a simple computation kernel.
Complete list of metadata
Contributor : Julien Herrmann <>
Submitted on : Tuesday, March 18, 2014 - 11:27:18 AM
Last modification on : Monday, November 16, 2020 - 9:56:02 AM
Long-term archiving on: : Thursday, June 19, 2014 - 2:25:20 PM


Files produced by the author(s)


  • HAL Id : hal-00960452, version 1



Thomas Hérault, Julien Herrmann, Loris Marchal, Yves Robert. Determining the optimal redistribution. [Research Report] RR-8499, 2014. ⟨hal-00960452v1⟩



Record views


Files downloads