Preemptive online scheduling with reordering

G. Dósa, Leah Epstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a positive fixed size, K, which assists in partial reordering of the input, is available for the storage of at most K unscheduled jobs. We study the effect of using a fixed sized buffer (of an arbitrary size) on the supremum competitive ratio over all numbers of machines (the overall competitive ratio), as well as the effect on the competitive ratio as a function of m. We find a tight bound on the competitive ratio for any m. This bound is for even values of m and slightly lower for odd values of m. We show that a buffer of size Θ(m) is sufficient to achieve this bound, but using K=o(m) does not reduce the best overall competitive ratio which is known for the case without reordering, . We further consider the semi-online variant where jobs arrive sorted by non-increasing processing time requirements. In this case we show that it is possible to achieve a competitive ratio of 1. In addition, we find tight bounds as a function of both K and m.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages456-467
Number of pages12
Volume5757 LNCS
DOIs
Publication statusPublished - 2009
Event17th Annual European Symposium on Algorithms, ESA 2009 - Copenhagen, Denmark
Duration: Sep 7 2009Sep 9 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5757 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other17th Annual European Symposium on Algorithms, ESA 2009
CountryDenmark
CityCopenhagen
Period9/7/099/9/09

Fingerprint

Preemptive Scheduling
Online Scheduling
Reordering
Competitive Ratio
Scheduling
Processing
Buffer
Identical Parallel Machines
Supremum
Odd
Sufficient
Partial
Requirements
Arbitrary

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Dósa, G., & Epstein, L. (2009). Preemptive online scheduling with reordering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5757 LNCS, pp. 456-467). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5757 LNCS). https://doi.org/10.1007/978-3-642-04128-0_41

Preemptive online scheduling with reordering. / Dósa, G.; Epstein, Leah.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5757 LNCS 2009. p. 456-467 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5757 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dósa, G & Epstein, L 2009, Preemptive online scheduling with reordering. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5757 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5757 LNCS, pp. 456-467, 17th Annual European Symposium on Algorithms, ESA 2009, Copenhagen, Denmark, 9/7/09. https://doi.org/10.1007/978-3-642-04128-0_41
Dósa G, Epstein L. Preemptive online scheduling with reordering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5757 LNCS. 2009. p. 456-467. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-04128-0_41
Dósa, G. ; Epstein, Leah. / Preemptive online scheduling with reordering. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5757 LNCS 2009. pp. 456-467 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{144dbec2d44f468592259ebf27e72242,
title = "Preemptive online scheduling with reordering",
abstract = "We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a positive fixed size, K, which assists in partial reordering of the input, is available for the storage of at most K unscheduled jobs. We study the effect of using a fixed sized buffer (of an arbitrary size) on the supremum competitive ratio over all numbers of machines (the overall competitive ratio), as well as the effect on the competitive ratio as a function of m. We find a tight bound on the competitive ratio for any m. This bound is for even values of m and slightly lower for odd values of m. We show that a buffer of size Θ(m) is sufficient to achieve this bound, but using K=o(m) does not reduce the best overall competitive ratio which is known for the case without reordering, . We further consider the semi-online variant where jobs arrive sorted by non-increasing processing time requirements. In this case we show that it is possible to achieve a competitive ratio of 1. In addition, we find tight bounds as a function of both K and m.",
author = "G. D{\'o}sa and Leah Epstein",
year = "2009",
doi = "10.1007/978-3-642-04128-0_41",
language = "English",
isbn = "3642041272",
volume = "5757 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "456--467",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Preemptive online scheduling with reordering

AU - Dósa, G.

AU - Epstein, Leah

PY - 2009

Y1 - 2009

N2 - We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a positive fixed size, K, which assists in partial reordering of the input, is available for the storage of at most K unscheduled jobs. We study the effect of using a fixed sized buffer (of an arbitrary size) on the supremum competitive ratio over all numbers of machines (the overall competitive ratio), as well as the effect on the competitive ratio as a function of m. We find a tight bound on the competitive ratio for any m. This bound is for even values of m and slightly lower for odd values of m. We show that a buffer of size Θ(m) is sufficient to achieve this bound, but using K=o(m) does not reduce the best overall competitive ratio which is known for the case without reordering, . We further consider the semi-online variant where jobs arrive sorted by non-increasing processing time requirements. In this case we show that it is possible to achieve a competitive ratio of 1. In addition, we find tight bounds as a function of both K and m.

AB - We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a positive fixed size, K, which assists in partial reordering of the input, is available for the storage of at most K unscheduled jobs. We study the effect of using a fixed sized buffer (of an arbitrary size) on the supremum competitive ratio over all numbers of machines (the overall competitive ratio), as well as the effect on the competitive ratio as a function of m. We find a tight bound on the competitive ratio for any m. This bound is for even values of m and slightly lower for odd values of m. We show that a buffer of size Θ(m) is sufficient to achieve this bound, but using K=o(m) does not reduce the best overall competitive ratio which is known for the case without reordering, . We further consider the semi-online variant where jobs arrive sorted by non-increasing processing time requirements. In this case we show that it is possible to achieve a competitive ratio of 1. In addition, we find tight bounds as a function of both K and m.

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

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

U2 - 10.1007/978-3-642-04128-0_41

DO - 10.1007/978-3-642-04128-0_41

M3 - Conference contribution

AN - SCOPUS:70350391693

SN - 3642041272

SN - 9783642041273

VL - 5757 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 456

EP - 467

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -