Consider the on-line problem where a number of servers are ready to provide service to a set of customers. Each customer's job can be handled by any of a subset of the servers. Customers arrive one-by-one and the problem is to assign each customer to an appropriate server in a manner that will balance the load on the servers. This problem can be modeled in a natural way by a bipartite graph where the vertices of one side (customers) appear one at a time and the vertices of the other side (servers) are known in advance. We derive tight bounds on the competitive ratio in both deterministic and randomized cases. Let n denote the number of servers. In the deterministic case we provide an on-line algorithm that achieves a competitive ratio of k = [log2 n] (up to an additive 1) and prove that this is the best competitive ratio that can be achieved by any deterministic on-line algorithm. In a similar way we prove that the competitive ratio for the randomized case is k=ln(n) (up to an additive 1). We conclude that for this problem, randomized algorithms differ from deterministic ones by precisely a constant factor.
[1]
Lyle A. McGeoch,et al.
Competitive algorithms for on-line problems
,
1988,
STOC '88.
[2]
Bala Kalyanasundaram,et al.
Online Weighted Matching
,
1993,
J. Algorithms.
[3]
Robert E. Tarjan,et al.
Amortized efficiency of list update and paging rules
,
1985,
CACM.
[4]
Michael E. Saks,et al.
An on-line graph coloring algorithm with sublinear performance ratio
,
1989,
Discret. Math..
[5]
Amos Fiat,et al.
Competitive Paging Algorithms
,
1991,
J. Algorithms.
[6]
Richard M. Karp,et al.
An optimal algorithm for on-line bipartite matching
,
1990,
STOC '90.
[7]
Allan Borodin,et al.
On the power of randomization in online algorithms
,
1990,
STOC '90.