Master-slave Tasking on Heterogeneous Processors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Master-slave Tasking on Heterogeneous Processors

Pierre-François Dutot
  • Function : Author
  • PersonId : 832190


In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are differ- ent. We assume that communication-computation overlap is possible for every processor, but only allow one send and one receive at a time. We propose an algorithm for chains of processors based on an iterative backward construction of the schedule, which is polynomial in the number of proces- sors and in the number of tasks. The complexity is O(np2 ) where n is the number of tasks and p the number of proces- sors. We prove this algorithm to be optimal with respect to the makespan. We extend this result to a special kind of tree called spider graphs.
Fichier principal
Vignette du fichier
d_ipdps03.pdf (96.6 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00001081 , version 1


Pierre-François Dutot. Master-slave Tasking on Heterogeneous Processors. International Parallel and Distributed Processing Symposium, Apr 2003, Nice, France. ⟨inria-00001081⟩
210 View
248 Download


Gmail Facebook X LinkedIn More