Skip to Main content Skip to Navigation

Parallel Data Redistribution Over a Backbone

Johanne Cohen 1 Emmanuel Jeannot 1 Nicolas Padoy
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this report we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish to minimize the total time required for the completion of all communications assuming that communications can be preempted and that preemption comes with an extra cost. Our problem, called k-Preemptive bipartite scheduling (KPBS) is proven to be NP-Complete. Moreover we prove that approximating KPBS problem within a ratio number smaller that4/3 is impossible unless P=NP. In spite of this negative result, we study a lower bound of this problem, and we propose an approximatio- n algorithm with ratio 2 and fast heuristics.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 6:59:22 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:41:36 PM


  • HAL Id : inria-00071861, version 1



Johanne Cohen, Emmanuel Jeannot, Nicolas Padoy. Parallel Data Redistribution Over a Backbone. [Research Report] RR-4725, INRIA. 2003. ⟨inria-00071861⟩



Record views


Files downloads