论文信息 - On-line Load Balancing for Related Machines

On-line Load Balancing for Related Machines

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 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e ≈ 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.

Marek Karpinski | Piotr Berman | Moses Charikar

[1] Jirí Sgall. A Lower Bound for Randomized On-Line Multiprocessor Scheduling , 1997, Inf. Process. Lett..

[2] Cynthia A. Phillips,et al. Improved Scheduling Algorithms for Minsum Criteria , 1996, ICALP.

[3] Gerhard J. Woeginger,et al. A Lower Bound for Randomized On-Line Scheduling Algorithms , 1994, Information Processing Letters.

[4] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.

[5] Rajeev Motwani,et al. Non-clairvoyant scheduling , 1994, SODA '93.

[6] Susanne Albers,et al. Better bounds for online scheduling , 1997, STOC '97.

[7] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[8] Yossi Azar,et al. On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9] D. Newman,et al. Yet more on the linear search problem , 1970 .

[10] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .

[11] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.