On the Competitiveness of a Modified Work Function Algorithm for Solving the On-Line k-Server Problem

We study a modification of the well known work function algorithm (WFA) for solving the on-line k-server problem. Our modified WFA is based on a moving window, i.e. on the approximate work function that takes into account only a fixed number of most recent on-line requests. In this paper we prove th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ITI 2008 : proceedings of the ITI 2008 30th International Conference on Information Technology Interfaces S. 779 - 784
Hauptverfasser: Rudec, T., Manger, R.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Zagreb IEEE 01.06.2008
University Computing Centre
Schlagworte:
Applied sciences
Approximation algorithms
competitiveness
Complexity theory
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Distance measurement
Exact sciences and technology
Extraterrestrial measurements
History
k-server problem
moving windows
on-line algorithms
on-line problems
Optimized production technology
Servers
Software
work function algorithm (WFA)
K server problem
Minimum time
Distributed system
Competitiveness
ISBN:9789537138127, 9537138127
ISSN:1330-1012
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study a modification of the well known work function algorithm (WFA) for solving the on-line k-server problem. Our modified WFA is based on a moving window, i.e. on the approximate work function that takes into account only a fixed number of most recent on-line requests. In this paper we prove that, in contrast to the original WFA, the modified WFA is not competitive. Our proof is based on a suitably constructed problem instance showing that the performance of the modified WFA can be an arbitrary number of times worse than optimal.
ISBN:9789537138127
9537138127
ISSN:1330-1012
DOI:10.1109/ITI.2008.4588510