Minimizing mean flowtime and makespan on master-slave systems

Document Type

Article

Publication Date

7-1-2005

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, 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. © 2005 Elsevier Inc. All rights reserved.

Identifier

19944383123 (Scopus)

Publication Title

Journal of Parallel and Distributed Computing

External Full Text Location

https://doi.org/10.1016/j.jpdc.2005.03.004

ISSN

07437315

First Page

843

Last Page

856

Issue

7

Volume

65

Grant

DMI-0300156

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS