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.
|Title of host publication||STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings|
|Editors||Afonso Ferreira, Horst Reichel|
|Number of pages||8|
|State||Published - 2001|
|Event||18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001 - Dresden, Germany|
Duration: 15 Feb 2001 → 17 Feb 2001
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001|
|Period||15/02/01 → 17/02/01|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)