Message Scheduling for Data Redistribution through High Performance Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Message Scheduling for Data Redistribution through High Performance Networks

Emmanuel Jeannot
Frédéric Wagner
  • Function : Author
  • PersonId : 832519

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.
Fichier principal
Vignette du fichier
A04-R-197.pdf (238.84 Ko) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00099881 , version 1

Cite

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. ⟨inria-00099881⟩
122 View
19 Download

Share

Gmail Facebook X LinkedIn More