Preemptive scheduling on a small number of hierarchical machines

G. Dósa, Leah Epstein

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In this model, each job can be assigned to a subset of the machines which is a prefix of the machine set. We design optimal offline and online algorithms for two uniformly related machines, both when the machine of higher hierarchy is faster and when it is slower, as well as for the case of three identical machines. Specifically, for each one of the three variants, we give a simple formula to compute the makespan of an optimal schedule, provide a linear time offline algorithm which computes an optimal schedule and design an online algorithm of the best possible competitive ratio.

Original languageEnglish
Pages (from-to)602-619
Number of pages18
JournalInformation and Computation
Volume206
Issue number5
DOIs
Publication statusPublished - May 2008

Fingerprint

Preemptive Scheduling
Online Algorithms
Schedule
Scheduling
Online Scheduling
Competitive Ratio
Prefix
Hierarchical Model
Linear-time Algorithm
Optimal Algorithm
Subset
Design
Model
Hierarchy

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Preemptive scheduling on a small number of hierarchical machines. / Dósa, G.; Epstein, Leah.

In: Information and Computation, Vol. 206, No. 5, 05.2008, p. 602-619.

Research output: Contribution to journalArticle

@article{c9e6aeed3aef412483d05eb3015d6d4a,
title = "Preemptive scheduling on a small number of hierarchical machines",
abstract = "We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In this model, each job can be assigned to a subset of the machines which is a prefix of the machine set. We design optimal offline and online algorithms for two uniformly related machines, both when the machine of higher hierarchy is faster and when it is slower, as well as for the case of three identical machines. Specifically, for each one of the three variants, we give a simple formula to compute the makespan of an optimal schedule, provide a linear time offline algorithm which computes an optimal schedule and design an online algorithm of the best possible competitive ratio.",
author = "G. D{\'o}sa and Leah Epstein",
year = "2008",
month = "5",
doi = "10.1016/j.ic.2007.11.004",
language = "English",
volume = "206",
pages = "602--619",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "5",

}

TY - JOUR

T1 - Preemptive scheduling on a small number of hierarchical machines

AU - Dósa, G.

AU - Epstein, Leah

PY - 2008/5

Y1 - 2008/5

N2 - We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In this model, each job can be assigned to a subset of the machines which is a prefix of the machine set. We design optimal offline and online algorithms for two uniformly related machines, both when the machine of higher hierarchy is faster and when it is slower, as well as for the case of three identical machines. Specifically, for each one of the three variants, we give a simple formula to compute the makespan of an optimal schedule, provide a linear time offline algorithm which computes an optimal schedule and design an online algorithm of the best possible competitive ratio.

AB - We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In this model, each job can be assigned to a subset of the machines which is a prefix of the machine set. We design optimal offline and online algorithms for two uniformly related machines, both when the machine of higher hierarchy is faster and when it is slower, as well as for the case of three identical machines. Specifically, for each one of the three variants, we give a simple formula to compute the makespan of an optimal schedule, provide a linear time offline algorithm which computes an optimal schedule and design an online algorithm of the best possible competitive ratio.

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

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

U2 - 10.1016/j.ic.2007.11.004

DO - 10.1016/j.ic.2007.11.004

M3 - Article

VL - 206

SP - 602

EP - 619

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 5

ER -