Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR00-001 | 14th January 2000 00:00

On-Line Load Balancing for Related Machines

RSS-Feed




TR00-001
Authors: Piotr Berman, Moses Charikar, Marek Karpinski
Publication: 14th January 2000 15:36
Downloads: 1281
Keywords: 


Abstract:

We consider the problem of scheduling permanent jobs on related machines
in an on-line fashion. We design a new algorithm that achieves the
competitive ratio of $3+\sqrt{8}\approx 5.828$ for the deterministic
version, and $3.31/\ln 2.155 \approx 4.311$ for its randomized variant,
improving the previous competitive ratios of 8 and $2e\approx 5.436$.
We also prove lower bounds of 2.4380 on the competitive ratio of
deterministic algorithms and 1.8372 on the competitive ratio of
randomized algorithms for this problem.



ISSN 1433-8092 | Imprint