More on weighted servers or FIFO is better than LRU

Authors:
Leah Epstein;Csanád Imreh;Rob van Stee
Affiliations:
School of Computer Science, THe Interdisciplinary Center, P.O. Box 167, 46150 Herzliya, Israel;University of Szeged, Ápád tér, 6701, Szeged, Hungary;Institut für Informatik, Albert-Ludwigs-Universität, Georges-Köhler-Allee, 79110 Freiburg, Germany
Venue:
Theoretical Computer Science
Year:
2003

Citing 7
Cited 2

Amortized efficiency of list update and paging rules

Communications of the ACM
A model for hierarchical memory

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Competitive algorithms for server problems

Journal of Algorithms
Competitive algorithms for the weighted server problem

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Competitive algorithms for relaxed list update and multilevel caching

Journal of Algorithms
Trackless online algorithms for the server problem

Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Limited bookmark randomized online algorithms for the paging problem

Information Processing Letters

The weighted 2-server problem

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Paging with connections: FIFO strikes again

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider a generalized two-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 ratios below 2.2, we present a best possible algorithm which is trackless. We present a general lower bound for trackless algorithms depending on the cost ratio, proving that our algorithm is the best possible 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.