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:Proceedings of the ITI 2010, 32nd International Conference on Information Technology Interfaces : 21-24 June 2010 s. 695 - 700
Hlavní autoři: Rudec, T, Baumgartner, A, Manger, R
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2010
Témata:
Computational modeling
experiments
Extraterrestrial measurements
Heuristic algorithms
k-server problem
Magnetic cores
on-line algorithms
On-line problems
Optimized production technology
Servers
work function algorithm (WFA)
ISBN:9781424457328, 1424457327
ISSN:1330-1012
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 the most accurate 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.
ISBN:9781424457328
1424457327
ISSN:1330-1012