ALCOMFT-TR-02-28

Leah Epstein, Csanád Imreh and Rob van Stee
More on weighted servers or FIFO is better than LRU
MPI. Work packages 2 and 4. May 2002.

Abstract: We consider a generalized 2-server problem on the uniform space in which servers have different costs. Previous work focused on the case where the ratio between these costs was very large. We give results for varying ratios. For small ratios, we present an optimal algorithm which is trackless. We present a general lower bound for trackless algorithms depending on the cost ratio, proving that our algorithm is the optimal trackless algorithm up to a constant factor for any cost ratio. The results are extended for the case where we have two sets of servers with different costs.

Postscript file: ALCOMFT-TR-02-28.ps.gz (59 kb).