Algorithms and complexity analyses for some combinatorial optimization problems
Algorithms and complexity analyses for some combinatorial optimization problems
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems
IEEE Transactions on Computers
The impact of heterogeneity on master-slave scheduling
Parallel Computing
The impact of heterogeneity on master-slave on-line scheduling
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.01 |
The master-slave scheduling model is a new model recently introduced by Sahni. It has many important applications in parallel computer scheduling and industrial settings such as semiconductor testing, machine scheduling, etc. In this model each job is associated with a preprocessing task, a slave task and a postprocessing task that must be executed in this order. While the preprocessing and postprocessing tasks are scheduled on the master machine, the slave tasks are scheduled on the slave machines. In this paper, we consider scheduling problems on single-master master-slave systems. We first strengthen some previously known complexity results for makespan problems, by showing them to be strongly NP-hard. We then show that the problem of minimizing the mean flowtime is strongly NP-hard even under severe constraints. Finally, we propose some heuristics for the mean flowtime and makespan problems subject to some constraints, and we analyze the worst-case performance of these heuristics.