On-line load balancing

Authors:
Y. Azar;A. Z. Broder;A. R. Karlin
Affiliations:
DEC Syst. Res. Center, Palo Alto, CA, USA;DEC Syst. Res. Center, Palo Alto, CA, USA;DEC Syst. Res. Center, Palo Alto, CA, USA
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 5

On-Line Load Balancing of Temporary Tasks Revisited

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On-Line Bin-Stretching

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
"Balls into Bins" - A Simple and Tight Analysis

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Anonymity and k-Choice Identities

Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The setup for the authors' problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a different level of service, and once assigned can not be re-assigned. They make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each task to an appropriate server in such a way that the maximum load on the servers is minimized. The authors derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely /sup (3n)2/3///sub 2/(1+o(1)), and derive a lower bound, Omega ( square root n), for any other deterministic or randomized on-line algorithm.