Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios

Leah Epstein

doi:10.1007/3-540-44693-1_20

Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study preemptive scheduling on uniformly related pro- cessors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non- decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.

Original language	English
Title of host publication	STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
Editors	Afonso Ferreira, Horst Reichel
Publisher	Springer Verlag
Pages	230-237
Number of pages	8
ISBN (Print)	9783540416951
DOIs	https://doi.org/10.1007/3-540-44693-1_20
State	Published - 2001
Externally published	Yes
Event	18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001 - Dresden, Germany Duration: 15 Feb 2001 → 17 Feb 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2010
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001
Country/Territory	Germany
City	Dresden
Period	15/02/01 → 17/02/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Keywords

Algorithms
Scheduling

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-44693-1_20

Cite this

Epstein, L. (2001). Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. In A. Ferreira, & H. Reichel (Eds.), STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (pp. 230-237). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2010). Springer Verlag. https://doi.org/10.1007/3-540-44693-1_20

Epstein, Leah. / Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. editor / Afonso Ferreira ; Horst Reichel. Springer Verlag, 2001. pp. 230-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{969bde5a19bc46d7ae420292a8a4033c,

title = "Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios",

abstract = "We study preemptive scheduling on uniformly related pro- cessors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non- decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.",

keywords = "Algorithms, Scheduling",

author = "Leah Epstein",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001 ; Conference date: 15-02-2001 Through 17-02-2001",

year = "2001",

doi = "10.1007/3-540-44693-1_20",

language = "English",

isbn = "9783540416951",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "230--237",

editor = "Afonso Ferreira and Horst Reichel",

booktitle = "STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",

address = "Germany",

}

Epstein, L 2001, Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. in A Ferreira & H Reichel (eds), STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2010, Springer Verlag, pp. 230-237, 18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001, Dresden, Germany, 15/02/01. https://doi.org/10.1007/3-540-44693-1_20

Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. / Epstein, Leah.
STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. ed. / Afonso Ferreira; Horst Reichel. Springer Verlag, 2001. p. 230-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios

AU - Epstein, Leah

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - We study preemptive scheduling on uniformly related pro- cessors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non- decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.

AB - We study preemptive scheduling on uniformly related pro- cessors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non- decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.

KW - Algorithms

KW - Scheduling

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

U2 - 10.1007/3-540-44693-1_20

DO - 10.1007/3-540-44693-1_20

M3 - Conference contribution

AN - SCOPUS:84957104796

SN - 9783540416951

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

SP - 230

EP - 237

BT - STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings

A2 - Ferreira, Afonso

A2 - Reichel, Horst

PB - Springer Verlag

T2 - 18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001

Y2 - 15 February 2001 through 17 February 2001

ER -

Epstein L. Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. In Ferreira A, Reichel H, editors, STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Springer Verlag. 2001. p. 230-237. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44693-1_20

Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this