Fast and Efficient Total Exchange on Two Clusters

Emmanuel Jeannot 1 Luiz Angelo Steffenel 1
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00177533
Contributor : Emmanuel Jeannot <>
Submitted on : Tuesday, October 16, 2007 - 11:29:12 AM
Last modification on : Thursday, May 16, 2019 - 6:46:08 PM
Long-term archiving on: Monday, September 24, 2012 - 1:15:15 PM

File

europar07.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

221

Files downloads

124