Measuring True Performance of the Work Function Algorithm for Solving the On-line k-Server Problem

This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. The paper is concerned with assessing actual performance of the WFA in terms of its serving costs. First, an efficient implementation of the WFA is briefly described. Next, some experiments are presente...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computing and information technology Ročník 18; číslo 4; s. 361
Hlavní autoři: Rudec, Tomislav, Baumgartner, Alfonzo, Manger, Robert
Médium: Journal Article Paper
Jazyk:angličtina
Vydáno: Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu 2010
Témata:
experiments
k-server problem
on-line algorithms
on-line problems
work function algorithm (WFA)
ISSN:1330-1136, 1846-3908
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. The paper is concerned with assessing actual performance of the WFA in terms of its serving costs. First, an efficient implementation of the WFA is briefly described. Next, some experiments are presented, where the performance of the implemented WFA has been measured on very large problem instances. Thereby, the problem instances have been selected from some frequently studied classes where sharp theoretical estimates of performance are available. Finally, the measured performance of the WFA is compared with the corresponding theoretical estimates and with some other algorithms.
Bibliografie:63906
ISSN:1330-1136
1846-3908
DOI:10.2498/cit.1001922