Two fast and efficient message scheduling algorithms for data redistribution through a backbone - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

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

Emmanuel Jeannot
Frédéric Wagner
  • Fonction : Auteur
  • PersonId : 832519

Résumé

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.
Fichier non déposé

Dates et versions

inria-00099979 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00099979 , version 1

Citer

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⟩
71 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More