A comparison of performance measures for online algorithms

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


This paper provides a systematic study of several recently suggested measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear points. Even though the problem is simple, it encapsulates a core challenge in online algorithms which is to balance greediness and adaptability. We examine how these measures evaluate the Greedy Algorithm and Lazy Double Coverage, commonly studied algorithms in the context of server problems. We examine Competitive Analysis, the Max/Max Ratio, the Random Order Ratio, Bijective Analysis and Relative Worst Order Analysis and determine how they compare the two algorithms. We find that by the Max/Max Ratio and Bijective Analysis, Greedy is the better algorithm. Under the other measures Lazy Double Coverage is better, though Relative Worst Order Analysis indicates that Greedy is sometimes better. Our results also provide the first proof of optimality of an algorithm under Relative Worst Order Analysis.
Original languageEnglish
Title of host publicationAlgorithms and Data Structures : 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings
EditorsFrank Dehne, Marina Gavrilova, Jorg-Rudiger Sack, Csaba D. Toth
Publication date2009
ISBN (Print)978-3-642-03366-7
Publication statusPublished - 2009
EventInternational Algorithms and Data Structures Symposium (WADS 2009) - , Canada
Duration: 21. Aug 200923. Aug 2009
Conference number: 11


ConferenceInternational Algorithms and Data Structures Symposium (WADS 2009)
SeriesLecture Notes in Computer Science


  • online algorithms
  • 2-server problem
  • performace measures


Dive into the research topics of 'A comparison of performance measures for online algorithms'. Together they form a unique fingerprint.

Cite this