Minimizing mean flowtime on master-slave machines

Document Type

Conference Proceeding

Publication Date

12-1-2004

Abstract

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, transportation maintenance, etc. In this model, each job has 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. We consider the problem of minimizing mean flowtime in the single-master master-slave model. We prove that the problem is strongly NP-hard even if all the preprocessing and postprocessing tasks have unit execution time. We then give a polynomial-time optimal algorithm for a special case. Finally, we give some heuristics for other special cases and we analyze their worst-case performance.

Identifier

12344286340 (Scopus)

ISBN

[1932415262, 9781932415261]

Publication Title

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA 04

First Page

939

Last Page

945

Volume

2

This document is currently not available here.

Share

COinS