Fast and Efficient Total Exchange on Two Clusters - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Fast and Efficient Total Exchange on Two Clusters

Emmanuel Jeannot
Luiz Angelo Steffenel


Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called ${\mathcal LG}$ for the total exchange redistribution problem between two clusters. In our approach we perform communications in two different phases, aiming to minimize the number of communication steps through the wide-area network. Therefore, we are able to reduce the number of messages exchanged through the backbone to only 2× max (n 1 ,n 2) against 2×n 1 ×n 2 messages with the traditional strategy (where n 1 and n 2 are the number of nodes of each clusters). Experimental results show that we reach over than 50% of performance improvement comparing to the traditional strategies.
Fichier principal
Vignette du fichier
europar07.pdf (160.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00177533 , version 1 (16-10-2007)



Emmanuel Jeannot, Luiz Angelo Steffenel. Fast and Efficient Total Exchange on Two Clusters. 13th International European Conference on Parallel and Distributed Computing - Euro-Par 2007, Aug 2008, Rennes, France. pp.848-857, ⟨10.1007/978-3-540-74466-5_91⟩. ⟨inria-00177533⟩
86 View
101 Download



Gmail Facebook Twitter LinkedIn More