Parallel Data Redistribution Over a Backbone - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Parallel Data Redistribution Over a Backbone

Johanne Cohen
Emmanuel Jeannot
Nicolas Padoy


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.
Fichier principal
Vignette du fichier
RR-4725.pdf (267.17 Ko) Télécharger le fichier

Dates and versions

inria-00071861 , version 1 (23-05-2006)


  • 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⟩
104 View
144 Download


Gmail Facebook Twitter LinkedIn More