Online Scheduling of Splittable Tasks

Leah Epstein; Rob van Stee

Online Scheduling of Splittable Tasks

Research output: Contribution to journal › Conference article › peer-review

Abstract

We consider online scheduling ofsplittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independently. We consider both the case where the machines are identical and the case where some subset of the machines have a (fixed) higher speed than the others. We design a class of algorithms which allows us to give tight bounds for a large class of cases where tasks may be split into relatively many parts. For identical machines we also improve upon the natural greedy algorithm in other classes of cases.

Original language	English
Journal	Dagstuhl Seminar Proceedings
Volume	5031
State	Published - 2005
Externally published	Yes
Event	Algorithms for Optimization with Incomplete Information 2005 - Wadern, Germany Duration: 16 Jan 2005 → 21 Jan 2005

Bibliographical note

Publisher Copyright:
© 2005 Dagstuhl Seminar Proceedings. All rights reserved.

ASJC Scopus subject areas

Software
Hardware and Architecture
Control and Systems Engineering

Cite this

@article{d7c0c530d9154a7ca7c680a8b291063a,

title = "Online Scheduling of Splittable Tasks",

abstract = "We consider online scheduling ofsplittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independently. We consider both the case where the machines are identical and the case where some subset of the machines have a (fixed) higher speed than the others. We design a class of algorithms which allows us to give tight bounds for a large class of cases where tasks may be split into relatively many parts. For identical machines we also improve upon the natural greedy algorithm in other classes of cases.",

author = "Leah Epstein and {van Stee}, Rob",

note = "Publisher Copyright: {\textcopyright} 2005 Dagstuhl Seminar Proceedings. All rights reserved.; Algorithms for Optimization with Incomplete Information 2005 ; Conference date: 16-01-2005 Through 21-01-2005",

year = "2005",

language = "English",

volume = "5031",

journal = "Dagstuhl Seminar Proceedings",

issn = "1862-4405",

}

TY - JOUR

T1 - Online Scheduling of Splittable Tasks

AU - Epstein, Leah

AU - van Stee, Rob

PY - 2005

Y1 - 2005

N2 - We consider online scheduling ofsplittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independently. We consider both the case where the machines are identical and the case where some subset of the machines have a (fixed) higher speed than the others. We design a class of algorithms which allows us to give tight bounds for a large class of cases where tasks may be split into relatively many parts. For identical machines we also improve upon the natural greedy algorithm in other classes of cases.

AB - We consider online scheduling ofsplittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independently. We consider both the case where the machines are identical and the case where some subset of the machines have a (fixed) higher speed than the others. We design a class of algorithms which allows us to give tight bounds for a large class of cases where tasks may be split into relatively many parts. For identical machines we also improve upon the natural greedy algorithm in other classes of cases.

UR - http://www.scopus.com/inward/record.url?scp=85174682819&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:85174682819

SN - 1862-4405

VL - 5031

JO - Dagstuhl Seminar Proceedings

JF - Dagstuhl Seminar Proceedings

T2 - Algorithms for Optimization with Incomplete Information 2005

Y2 - 16 January 2005 through 21 January 2005

ER -

Online Scheduling of Splittable Tasks

Abstract

Bibliographical note

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this