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

Master-Slave Tasking with Heterogeneous Processors

Arnaud Legrand
Yves Robert

Abstract

In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing 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. We propose an algorithm for chains of processors based on an iterative backward construction of the schedule, which is polynomial in the number of processors and in the number of tasks. The complexity is O(np2) where n is the number of tasks and p the number of processors. 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.
No file

Dates and versions

hal-00789462 , version 1 (18-02-2013)

Identifiers

Cite

Olivier Beaumont, Arnaud Legrand, Yves Robert. Master-Slave Tasking with Heterogeneous Processors. 2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA\'2001), 2001, Unknown, pp.857―863, ⟨10.1109/IPDPS.2003.1213103⟩. ⟨hal-00789462⟩
71 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More