An experimental study of online scheduling algorithms

Susanne Albers, Bianca Schröder

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We present the first comprehensive experimental study of online algorithms for Graham's scheduling problem. In Graham's schedulingproblem, which is a fundamental and extensively studied problem in schedulingtheory, a sequence of jobs has to be scheduled on m identical parallel machines so as to minimize the makespan. Graham gave an elegant algorithm that is (2 - 1/m)-competitive. Recently a number of new online algorithms were developed that achieve competitive ratios around 1.9. Since competitive analysis can only capture the worst case behavior of an algorithm a question often asked is: Are these new algorithms geared only towards a pathological case or do they perform better in practice, too? We address this question by analyzingthe algorithms on various job sequences. We have implemented a general testing environment that allows a user to generate jobs, execute the algorithms on arbitrary job sequences and obtain a graphical representation of the results. In our actual tests, we analyzed the algorithms (1) on real world jobs and (2) on jobs generated by probability distributions. It turns out that the performance of the algorithms depends heavily on the characteristics of the respective work load. On job sequences that are generated by standard probability distributions, Graham's strategy is clearly the best. However, on the real world jobs the new algorithms often outperform Graham's strategy. Our experimental study confirms theoretical results and gives some new insights into the problem. In particular, it shows that the techniques used by the new online algorithms are also interesting from a practical point of view.

Original languageEnglish
Title of host publicationAlgorithm Engineering - 4th International Workshop, WAE 2000, Proceedings
EditorsStefan Naher, Dorothea Wagner
PublisherSpringer Verlag
Pages11-22
Number of pages12
ISBN (Print)3540425128, 9783540425120
DOIs
StatePublished - 2001
Externally publishedYes
Event4th International Workshop on Algorithm Engineering, WAE 2000 - Saarbrucken, Germany
Duration: 5 Sep 20008 Sep 2000

Publication series

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

Conference

Conference4th International Workshop on Algorithm Engineering, WAE 2000
Country/TerritoryGermany
CitySaarbrucken
Period5/09/008/09/00

Fingerprint

Dive into the research topics of 'An experimental study of online scheduling algorithms'. Together they form a unique fingerprint.

Cite this