2013 IEEE International Conference on Cluster Computing (CLUSTER) (2001)
Newport Beach, CA
Oct. 8, 2001 to Oct. 11, 2001
Olivier Beaumont , LIP, UMR CNRS-ENS Lyon-INRIA 5668
Arnaud Legrand , LIP, UMR CNRS-ENS Lyon-INRIA 5668
Yves Robert , LIP, UMR CNRS-ENS Lyon-INRIA 5668
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm that gives the optimal solution when a single communication is needed before the execution of the tasks on the slave processors. When communications are required both before and after the task processing, we show that the problem is at least as difficult as a problem whose complexity is open. In this case, we present a guaranteed approximation algorithm. Finally, we present asymptotically optimal algorithms when communications are required before the processing of each task, or both before and after the processing of each task.
heterogeneous processors, master-slave tasking, communication, matching, complexity.
O. Beaumont, A. Legrand and Y. Robert, "The Master-Slave Paradigm with Heterogeneous Processors," 2013 IEEE International Conference on Cluster Computing (CLUSTER), Newport Beach, CA, 2001, pp. 419.