Naslov
Work function algorithm with a moving window for solving the on-line k-server problem

Autori
Baumgartner, Alfonzo ; Manger, Robert ; Hocenski Željko

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of the 29th International Conference on Information Technology Interfaces (ITI 2007 - Cavtat, Croatia, June 25-28, 2007) / Lužar-Stiffler, Vesna ; Dobić Hljuz, Vesna - Zagreb : Sveučilišni računski centar Sveučilišta u Zagrebu (Srce), 2007, 507-512

ISBN
953-7138-10-0

Skup
29th International Conference on Information Technology Interfaces (ITI 2007)

Mjesto i datum
Cavtat, Hrvatska, 25.06.2007. - 28.06.2007

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
on-line problems; on-line algorithms; the k-server problem; the work function algorithm (WFA); moving windows; experiments

Sažetak
We consider 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. The main motivation for using a moving window is to gain control over the prohibitive computational complexity imposed by the original algorithm. Experimental results are presented, where the performance of the modified WFA has been compared vs. the original WFA.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Računarstvo

POVEZANOST RADA