A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Efficient Assignment and Scheduling for Heterogeneous DSP Systems
IEEE Transactions on Parallel and Distributed Systems
Future Generation Computer Systems
The impact of heterogeneity on master-slave scheduling
Parallel Computing
The Journal of Supercomputing
A new load distribution strategy for linear network with communication delays
Mathematics and Computers in Simulation
Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
International Journal of Computational Science and Engineering
Extending IC-scheduling via the Sweep Algorithm
Journal of Parallel and Distributed Computing
Greedy "exploitation" is close to optimal on node-heterogeneous clusters
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
A model of pilot-job resource provisioning on production grids
Parallel Computing
Grid enabled master slave task scheduling for heterogeneous processor paradigm
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Tuning application in a multi-cluster environment
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Efficient execution of scientific computation on geographically distributed clusters
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Optimizing locationing of multiple masters for master-worker grid applications
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
New method for scheduling heterogeneous multi-installment systems
Future Generation Computer Systems
On scheduling dag s for volatile computing platforms: Area-maximizing schedules
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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.