DMCA
The masterslave paradigm with heterogeneous processors (2001)
| Citations: | 39 - 12 self |
BibTeX
@TECHREPORT{Beaumont01themasterslave,
author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
title = {The masterslave paradigm with heterogeneous processors},
institution = {},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
