Two fast and efficient message scheduling algorithms for data redistribution through a backbone

Emmanuel Jeannot 1 Frédéric Wagner 1
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study the problem of redistributing in parallel data between clusters interconnected by a backbone. This problem is a generalization of the well-known redistribution problem that appears in parallelism. We suppose that at most k communications can be performed at the same time (the value of k depending on the characteristics of the platform). We use the knowledge of the application in order to schedule the messages and perform a control of the congestion by ourselves. Previous results show that this problem is NP-Complete. We propose and study two fast and efficient algorithms for this problem. We prove that these algorithms are 2-approximation algorithms. Simulation results show that both algorithms perform very well compared to the optimal solution. These algorithms have been implemented using MPI. Experimental results show that both algorithms outperform a brute-force TCP based solution, where no scheduling of the messages is performed.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00099979
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:13:04 AM
Last modification on : Thursday, May 16, 2019 - 6:46:13 PM

Identifiers

  • HAL Id : inria-00099979, version 1

Collections

Citation

Emmanuel Jeannot, Frédéric Wagner. Two fast and efficient message scheduling algorithms for data redistribution through a backbone. 18th International Parallel and Distributed Processing Symposium - IPDPS'04, 2004, Santa Fe, New Mexico, 10 p. ⟨inria-00099979⟩

Share

Metrics

Record views

175