Semi-online Multiprocessor Scheduling with Nonsimultaneous Machine Available Times

Author

Sun, Haina ; Huang, Yikun

Author_Institution

Dept. of Fundamental Educ., Zhejiang Univ., Ningbo, China

Volume

3

fYear

2010

fDate

4-6 June 2010

Firstpage

115

Lastpage

118

Abstract

This paper investigates scheduling problems on m parallel identical machines with non-simultaneous machine available times. Each machine M_i is not available until time r_i. Jobs arrive one by one, and we are required to schedule jobs irrevocably on machines as soon as they are given, without any knowledge of the successive jobs. We study semi-online version of the problem while we known the largest processing time of all jobs in advance, the objective is to minimize the makespan, i.e. the maximum completion time of the processors. A lower bound (√(33) + 3)/6 is showed when the number of machines is greater than 6, and a semi-online algorithm is presented with competitive ratio of at most 2-1/(m-1).

Keywords

microprocessor chips; multiprocessing systems; processor scheduling; lower bound; nonsimultaneous machine; parallel identical machines; semionline algorithm; semionline multiprocessor scheduling; Concurrent computing; Educational institutions; Educational technology; Helium; Job shop scheduling; Paper technology; Parallel machines; Processor scheduling; Scheduling algorithm; Sun; competitive ratio; scheduling; semi-online algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Computing (ICIC), 2010 Third International Conference on

Conference_Location

Wuxi, Jiang Su

Print_ISBN

978-1-4244-7081-5

Electronic_ISBN

978-1-4244-7082-2

Type

conf

DOI

10.1109/ICIC.2010.213

Filename

5513935