Complexity of Master-slave Tasking on Heterogeneous Trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2005

Complexity of Master-slave Tasking on Heterogeneous Trees

Résumé

In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors and network, where processing times and communications times are different. We assume that communication-computation overlap is possible for every processor, but only allow one send and one receive at a time. In this model, we prove that scheduling on a tree network is NP-hard in the strong sense, reducing the problem to the well-known 3-partition problem.
Fichier principal
Vignette du fichier
d_ejor04.pdf (139.54 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00001076 , version 1 (01-02-2006)

Identifiants

  • HAL Id : inria-00001076 , version 1

Citer

Pierre-François Dutot. Complexity of Master-slave Tasking on Heterogeneous Trees. European Journal of Operational Research, 2005, 164 (3), pp.690-695. ⟨inria-00001076⟩
127 Consultations
172 Téléchargements

Partager

Gmail Facebook X LinkedIn More