A k-server problem with parallel requests and unit distances

Authors:
R. Hildenbrandt
Affiliations:
-
Venue:
Information Processing Letters
Year:
2014

Citing 6
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the k-server conjecture

Journal of the ACM (JACM)
Online computation and competitive analysis

Online computation and competitive analysis
The harmonic k-server algorithm is competitive

Journal of the ACM (JACM)
Memory Versus Randomization in On-line Algorithms (Extended Abstract)

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we consider k-server problems with parallel requests where several servers can also be located on one point. We will distinguish the surplus-situation where the request can be completely fulfilled by means of the k servers and the scarcity-situation where the request cannot be completely met. We use the method of the potential function by Bartal and Grove [2] in order to prove that a corresponding Harmonic algorithm is competitive for the more general k-server problem in the case of unit distances. For this purpose we partition the set of points in relation to the online and offline servers@? positions and then use detailed considerations related to sets of certain partitions.