The Master-Slave Paradigm with Heterogeneous Processors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Parallel and Distributed Systems Year : 2003

The Master-Slave Paradigm with Heterogeneous Processors

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.

Dates and versions

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

Identifiers

Cite

Olivier Beaumont, Arnaud Legrand, Yves Robert. The Master-Slave Paradigm with Heterogeneous Processors. IEEE Transactions on Parallel and Distributed Systems, 2003, 14, pp.897―908. ⟨10.1109/TPDS.2003.1233712⟩. ⟨hal-00789429⟩
129 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More