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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00099881
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:02:00 AM
Last modification on : Thursday, May 16, 2019 - 6:46:13 PM
Long-term archiving on : Wednesday, March 29, 2017 - 1:22:21 PM

Identifiers

  • 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. ⟨inria-00099881⟩

Share

Metrics

Record views

284

Files downloads

187