Speaker: Ying Gong
<br>
<br>
Title: The Master-Slave Paradigm with Heterogeneous Processors
<br>
<br>
In this paper, we revisit the master-slave tasking paradigm in 
the context of heterogeneous processors. 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.