Message Scheduling for Data Redistribution through High Performance Networks

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 : With the emergence of large scale distributed computing, new problems bound to data transfers are appearing. We present the problem of data redistribution between two clusters connected by a high performance network. This problem consists in finding the best way to transfer data from the first cluster to the second one in the shortest possible time. In order to avoid slowing down the network, and the transfer, it is necessary to schedule the messages. This problem (named as KPBS) is known to be NP-complete and we present here a 2-approximation algorithm we developed.
Type de document :
Communication dans un congrès
DistRibUtIon de Données à grande Echelle - DRUIDE'2004, May 2004, Le Croisic/France, pp.10, 2004
Liste complète des métadonnées

https://hal.inria.fr/inria-00099881
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:02:00
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Document(s) archivé(s) le : mercredi 29 mars 2017 - 13:22:21

Fichiers

Identifiants

  • HAL Id : inria-00099881, version 1

Collections

Citation

Emmanuel Jeannot, Frédéric Wagner. Message Scheduling for Data Redistribution through High Performance Networks. DistRibUtIon de Données à grande Echelle - DRUIDE'2004, May 2004, Le Croisic/France, pp.10, 2004. 〈inria-00099881〉

Partager

Métriques

Consultations de la notice

254

Téléchargements de fichiers

34