In EDS ansehen

The design and analysis of a modified work function algorithm for solving the on-line k-server problem

Gespeichert in:
Bibliographische Detailangaben
Titel: The design and analysis of a modified work function algorithm for solving the on-line k-server problem
Autoren: Manger, Robert, Rudec, Tomislav
Quelle: Computing and informatics. 29(4):681-700
Verlagsinformationen: 2010.
Publikationsjahr: 2010
Schlagwörter: competitiveness, computational complexity, k-server problem, work function algorithm (WFA), network flows, moving windows, experiments, implementation, on-line algorithms, performance, on-line problems
Beschreibung: In this paper we study a modified work function algorithm (WFA) for solving the on-line k-server problem. Our modification is based on a moving window, i.e. on an approximate work function that takes into account only a fixed number of most recent on-line requests. We give a precise specification of the modified WFA, investigate its competitiveness, and explain how it can be implemented efficiently by network flows. We also present experiments that measure the performance and computational complexity of the implemented algorithm. The results of the paper can be summarized as follows: the modified WFA is not competitive, but according to the experiments it still provides almost the same quality of serving as the original WFA while running much faster.
Publikationsart: Article
ISSN: 1335-9150
Zugangs-URL: http://www.sav.sk/index.php?lang=sk&charset=&doc=journal&part=list_articles&journal_issue_no=11112385#abstract_5962
Dokumentencode: edsair.dris...01492..252e63508206ea8abdbcd8080c897e8c
Datenbank: OpenAIRE
Beschreibung
Abstract:In this paper we study a modified work function algorithm (WFA) for solving the on-line k-server problem. Our modification is based on a moving window, i.e. on an approximate work function that takes into account only a fixed number of most recent on-line requests. We give a precise specification of the modified WFA, investigate its competitiveness, and explain how it can be implemented efficiently by network flows. We also present experiments that measure the performance and computational complexity of the implemented algorithm. The results of the paper can be summarized as follows: the modified WFA is not competitive, but according to the experiments it still provides almost the same quality of serving as the original WFA while running much faster.
ISSN:13359150