Load balancing of temporary tasks in the ℓp norm

Theoretical Computer Science

Volumn 361, Issue 2-3, 2006, Pages 314-328

  Azar, Yossi ^a   Epstein, Amir ^a   Epstein, Leah ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Competitive ratio; lp norm; Load balancing; Online algorithms; Temporary tasks

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

COMPETITIVE RATIO; LP NORM; LOAD BALANCING; ONLINE ALGORITHMS; TEMPORARY TASKS;

JOB ANALYSIS;

EID: 33746893859     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.016     Document Type: Article

References (18)

1. Albers S. Better bounds for online scheduling. SIAM J. Comput. 29 (1999) 459-473
2. Alon N., Azar Y., Woeginger G., and Yadid T. Approximation schemes for scheduling on parallel machines. J. Scheduling 1 1 (1998) 55-66
3. p norm. Algorithmica 29 (2001) 422-441
4. Azar Y., and Epstein L. On-line load balancing of temporary tasks on identical machines. SIAM J. Discrete Math. 18 2 (2004) 347-352
5. Azar Y., Regev O., Sgall J., and Woeginger G. Off-line temporary tasks assignment. Theoret. Comput. Sci. 287 (2002) 419-428
6. Bartal Y., Fiat A., Karloff H., and Vohra R. New algorithms for an ancient scheduling problem. J. Comput. System Sci. 51 3 (1995) 359-366
7. Bartal Y., Karloff H., and Rabani Y. A better lower bound for on-line scheduling. Inform. Process. Lett. 50 (1994) 113-116
8. Chandra A.K., and Wong C.K. Worst-case analysis of a placement algorithm related to storage allocation. SIAM J. Comput. 4 3 (1975) 249-263
9. Faigle U., Kern W., and Turan G. On the performance of online algorithms for partition problems. Acta Cybernet. 9 (1989) 107-119
10. Fleischer R., and Wahl M. Online scheduling revisited. J. Scheduling 3 5 (2000) 343-353
11. T. Gormley, N. Reingold, E. Torng, J. Westbrook, Generating adversaries for request-answer games, in: Proc. 11th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2000, pp. 564-565.
12. Graham R.L. Bounds for certain multiprocessing anomalies. Bell System Technical J. 45 (1966) 1563-1581
13. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17 (1969) 416-429
14. Hochbaum D.S., and Shmoys D.B. Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. Assoc. Comput. Mach. 34 1 (1987) 144-162
15. Karger D., Phillips S., and Torng E. A better algorithm for an ancient scheduling problem. J. Algorithms 20 2 (1996) 400-430
16. Leung J.Y.T., and Wei W.D. Tighter bounds on a heuristic for a partition problem. Inform. Process. Lett. 56 (1995) 51-57
17. J.F. Rudin III, Improved bounds for the on-line scheduling problem, Ph.D. Thesis, The University of Texas at Dallas, May 2001.
18. Sahni S. Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach. 23 (1976) 116-127