Resource augmentation in load balancing

Journal of Scheduling

Volumn 3, Issue 5, 2000, Pages 249-258

  Azar, Yossi ^a   Epstein, Leah ^a   Van Stee, Rob ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b CWI   (Netherlands)

Author keywords

Competitive ratio; Load balancing; On line

Indexed keywords

EID: 0346438776     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1425(200009/10)3:5<249::aid-jos46>3.0.co;2-9     Document Type: Article

References (21)

1. Kalyanasundaram B, Pruhs K. Speed is as powerful as clairvoyance. In Proceedings of 36th IEEE Symposium on Foundations of Computer Science, 1995; 214-221.
2. Sleator D, Tarjan RE. Amortized efficiency of list update and paging rules. Communications of the ACM 1985; 28:202-208.
3. Herman P, Coulston C. Speed is more powerful than clairvoyance. Nordic Journal of Computing 1999; 6:181-193.
4. Edmonds J. Scheduling in the dark. In Proceedings of the 31st ACM Symposium on Theory of Computing, 1999; 179-188.
5. Kalyanasundaram B, Pruhs K. Maximizing job completions online. In European Symposium on Algorithms 1998; 235-246.
6. Lam TW, To KK. Trade-offs between speed and processor in hard-deadline scheduling. In ACM/SIAM Symposium on Discrete Algorithms, 1999; 623-332.
7. Philips CA, Stein C, Torng E, Wein J. Optimal time-critical scheduling via resource augmentation. In Proceedings of the 29th ACM Symposium on Theory of Computing, 1997; 140-149.
8. Graham RL. Bounds for certain multiprocessor anomalies. Bell System Technical Journal 1966; 45:1563-1581.
9. Graham RL. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 1969; 17:263-269.
10. Bartal Y, Fiat A, Karloff H, Vohra R. New algorithms for an ancient scheduling problem. In Proceedings of 24th ACM Symposium on Theory of Algorithms, 1992; 51-58. Journal of Computer and System Sciences 1995; 51:359-366.
11. Bartal Y, Fiat A, Karloff H, Vohra R. New algorithms for an ancient scheduling problem. In Proceedings of 24th ACM Symposium on Theory of Algorithms, 1992; 51-58. Journal of Computer and System Sciences 1995; 51:359-366.
12. Karger DR, Phillips SJ, Torng E. A better algorithm for an ancient scheduling problem. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, 1994; 132-140.
13. Albers S. Better bounds for on-line scheduling. In Proceedings of 29th ACM Symposium on Theory of Computing, 1997; 130-139.
14. Gormley T, Reingold N, Torng E, Westbrook J. Generating adversaries for request-answer games. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 2000.
15. Brehob M, Torng E, Uthaisombut P. Applying extra-resource analysis to load balancing. Manuscript, 1999.
16. Chen B, van Vliet A, Woeginger GJ. Lower bounds for randomized online scheduling. Information Processing Letters 1994; 51:219-222.
17. Chen B, van Vliet A, Woeginger GJ. An optimal algorithm for preemptive on-line scheduling. Operations Research Letters 1995; 18:127-131.
18. Sgall J. A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters 1997; 63(1):51-55.
19. Azar Y, Epstein L. On-line load balancing of temporary tasks on identical machines. In 5th Israeli Symposium on Theory of Computing and Systems, 1997; 119-125.
20. Epstein L, Sgall J. A lower bound for on-line scheduling on uniformly related machines. Operations Research Letters 2000; to appear.
21. McNaughton R. Scheduling with deadlines and loss functions. Management Science 1959; 6:1-12.