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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationSTACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditorsAfonso Ferreira, Horst Reichel
PublisherSpringer Verlag
Pages230-237
Number of pages8
ISBN (Print)9783540416951
DOIs
StatePublished - 2001
Externally publishedYes
Event18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001 - Dresden, Germany
Duration: 15 Feb 200117 Feb 2001

Publication series

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

Conference

Conference18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001
Country/TerritoryGermany
CityDresden
Period15/02/0117/02/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Keywords

  • Algorithms
  • Scheduling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios'. Together they form a unique fingerprint.

Cite this