Napredna pretraga

Pregled bibliografske jedinice broj: 321479

Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem


Baumgartner, Alfonzo; Manger, Robert; Hocenski, Željko
Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem // Journal of Computing and Information Technology - CIT, 15 (2007), 4; 325-330 (podatak o recenziji nije dostupan, članak, znanstveni)


Naslov
Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem

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

Izvornik
Journal of Computing and Information Technology - CIT (1330-1136) 15 (2007), 4; 325-330

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
On-line problems; on-line algorithms; k-server problem; 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


Projekt / tema
037-0362980-2774 - Distribuirani algoritmi za pronalaženje optimalnih putova u grafovima (Robert Manger, )
165-0361621-2000 - Distribuirano računalno upravljanje u transportu i industrijskim pogonima (Željko Hocenski, )

Ustanove
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek

Uključenost u ostale bibliografske baze podataka:


  • INSPEC
  • Zentralblatt fuer Mathematik/Mathematics Abstracts