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

We consider a modification of the well known work function algorithm (WFA) for solving the on-line kserver 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 fo...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computing and information technology Vol. 15; no. 4; pp. 325 - 330
Main Authors: Baumgartner, Alfonzo, Manger, Robert, Hocenski, eljko
Format: Journal Article Conference Proceeding Paper
Language:English
Published: Zagreb University Computing Centre 01.12.2007
Sveuciliste U Zagrebu
Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu
Subjects:
Algorithms
Analysis
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
United States
K server problem
Work function
Motivation
experiments
on-line algorithms
Windows
Distributed system
moving windows
on-line problems
Computational complexity
work function algorithm (WFA)
k- server problem
ISSN:1330-1136, 1846-3908
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a modification of the well known work function algorithm (WFA) for solving the on-line kserver 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.
Bibliography:44613
ISSN:1330-1136
1846-3908
DOI:10.2498/cit.1001140