The Master-Slave Paradigm with Heterogeneous Processors

Olivier Beaumont 1 Arnaud Legrand 1 Yves Robert 1
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications are handled by a bus and, therefore, at most one communication can take place at a given time step. 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 processing of the tasks, we show that the problem is strongly NP-complete. 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.
Type de document :
Communication dans un congrès
Katz, D. S. and Sterling, T. and Baker, M. and Bergman, L. and Paprzycki, M. and Buyya, R. Cluster\'2001, 2001, Unknown, IEEE Computer Society Press, pp.419―426, 2001, 〈10.1109/TPDS.2003.1233712〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00789460
Contributeur : Arnaud Legrand <>
Soumis le : lundi 18 février 2013 - 11:51:51
Dernière modification le : vendredi 20 avril 2018 - 15:44:24

Lien texte intégral

Identifiants

Collections

Citation

Olivier Beaumont, Arnaud Legrand, Yves Robert. The Master-Slave Paradigm with Heterogeneous Processors. Katz, D. S. and Sterling, T. and Baker, M. and Bergman, L. and Paprzycki, M. and Buyya, R. Cluster\'2001, 2001, Unknown, IEEE Computer Society Press, pp.419―426, 2001, 〈10.1109/TPDS.2003.1233712〉. 〈hal-00789460〉

Partager

Métriques

Consultations de la notice

142