More on Weighted Servers or FIFO is Better than LRU

Authors:
Leah Epstein;Csanád Imreh;Rob van Stee
Affiliations:
-;-;-
Venue:
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Year:
2002

Citing 10
Cited 3

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
On-line file caching

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Competitive algorithms for multilevel caching and relaxed list update

Proceedings of the ninth annual ACM-SIAM symposium on Discrete 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

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal

SIGACT news online algorithms column 1

ACM SIGACT News
SIGACT news online algorithms column 2

ACM SIGACT News
On the on-line weighted k-taxi problem

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

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 ratios below 2.2, 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.