A new bound for space bounded server algorithms

Authors:
Stephen Hughes
Affiliations:
Dickinson College, Carlisle, PA
Venue:
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
Year:
1995

Citing 5
Cited 0

Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Strongly competitive algorithms for paging with locality of reference

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the k-server conjecture

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
New results on server problems

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On Space Bounded Server Algorithms

ICCI '93 Proceedings of the Fifth International Conference on Computing and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the competitive factor of space bounded algorithms for the k-server problem operating in finite metric spaces. Specifically, two methods are developed for obtaining an upper bound on competitive factors of arbitrary space bounded algorithms. One of these methods is then used to show that an LRU-like algorithm is linearly-competitive on a uniform metric space.