On-line load balancing of temporary tasks on identical machines

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 2, 2004, Pages 347-352

  Azar, Yossi ^a   Epstein, Leah ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Competitive ratio; Load balancing; On line; Scheduling; Temporary tasks

Indexed keywords

ALGORITHMS; ELECTRIC LOADS; MACHINE COMPONENTS; OPTIMAL CONTROL SYSTEMS; RANDOM PROCESSES; SCHEDULING;

COMPETITIVE RATIO; IDENTICAL MACHINES; LOAD BALANCING; TEMPORARY TASKS;

ONLINE SYSTEMS;

EID: 18744397552     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197329296     Document Type: Article

References (15)

1. S. ALBERS, Better bounds for online scheduling, SIAM J. Comput., 29 (1999), pp. 459-473.
2. Y. AZAR, A. BRODER, AND A. KARLIN, On-line load balancing, Theoret. Comput. Sci., 130 (1994), pp. 73-84.
3. Y. AZAR, B. KALYANASUNDARAM, S. PLOTKIN, K. PRUHS, AND O. WAARTS, On-line load balancing of temporary tasks, J. Algorithms, 22 (1997), pp. 93-110.
4. Y. AZAR, J. NAOR, AND R. ROM, The competitiveness of on-line assignments, J. Algorithms, 18 (1995), pp. 221-237.
5. Y. BARTAL, A. FIAT, H. KARLOFF, AND R. VOHRA, New algorithms for an ancient scheduling problem, J. Comput. System Sci., 1995, pp. 359-366.
6. Y. BARTAL, H. KARLOFF, AND Y. RABANI, A better lower bound for on-line scheduling, Inform. Process. Lett., 50 (1994), pp. 113-116.
7. A. BORODIN AND R. EL-YANIV, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, UK, 1998.
8. B. CHEN, A. VAN VLIET, AND G. WOEGINGER, A lower bound for randomized on-line scheduling algorithms, Inform. Process. Lett., 51 (1994), pp. 219-222.
9. B. CHEN, A. VAN VLIET, AND G. WOEGINGER, New lower and upper bounds for on-line scheduling, Oper. Res. Lett., 16 (1994), pp. 221-230.
10. U. FAIGLE, W. KERN, AND G. TURAN, On the performance of online algorithms for partition problems, Acta Cybernet., 9 (1989), pp. 107-119.
11. G. GALAMBOS AND G. WOEGINGER, An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling, SIAM J. Comput., 22 (1993), pp. 349-355.
12. R. GRAHAM, Bounds for certain multiprocessor anomalies, Bell System Tech. J., 45 (1966), pp. 1563-1581.
13. R. GRAHAM, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 416-429.
14. D. KARGER, S. PHILLIPS, AND E. TORNG, A better algorithm for an ancient scheduling problem, J. Algorithms, 20 (1996), pp. 400-430.
15. J. SGALL, On-line scheduling on parallel machines, Technical report CMU-CS-94-144, Carnegie Mellon University, Pittsburgh, PA, 1994.