Competitive algorithms for server problems
Journal of Algorithms
Random walks on weighted graphs, and applications to on-line algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
New results on server problems
SIAM Journal on Discrete Mathematics
On fast algorithms for two servers
Journal of Algorithms
A competitive 3-server algorithm
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Reducing disk power consumption in a portable computer
ACM SIGOPS Operating Systems Review
Linear programs for randomized on-line algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We propose a new algorithm called Equipoise for the k-server problem, and we prove that it is 2-competitive for two servers and 11-competitive for three servers. For k=3, this is a tremendous improvement over previously known constants. The algorithm uses several techniques for designing on-line algorithms - convex hulls, work functions and forgiveness.The results presented in this paper were earlier announced at the DIMACS Workshop on On-Line Algorithms [8].