On-line load balancing for related machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1272, Issue , 1997, Pages 116-125

  Berman, Piotr ^a   Charikar, Moses ^b   Karpinski, Marek ^c,d  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c UNIVERSITY OF BONN   (Germany)

^d INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; LINE LOADS; LOWER BOUNDS; ON-LINE FASHION; RANDOMIZED ALGORITHMS; RELATED MACHINES;

BALANCING;

EID: 84938251689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_52     Document Type: Conference Paper

References (13)

1. S. Albers, Better bounds for online scheduling, Proc. 29th ACM STOC (1997), pp. 130-139.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing, Proc. 25th ACM STOC (1993), pp. 623-631.
3. Y. Azar, A. Broder, A. Karlin, On-line load balancing, Proc. 33rd IEEE FOCS (1992), pp. 218-225.
4. Y. Azar, J. Naor, R. Rom, The competitiveness of on-line assignment, Proc. 3rd ACM-SIAM SODA (1992), pp. 203-210.
5. A. Beck and D. Newman, Yet more on the linear search problem, Israel Journal of Math., 8:419-429, 1970.
6. S. Chakrabarti, C. Phillips, A. Schulz, D.B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria, Proc. 23rd ICALP, Springer, 1996.
7. B. Chen, A. van Vliet and G. J. Woeginger, A lower bound for randomized on-line scheduling algorithms, Information Processing Letters, vol.51, no.5, pp. 219-22.
8. P. Indyk, personal communication.
9. S. Gal, Search Games, Academic Press, 1980.
10. M. Goemans and J. Kleinberg, An improved approximation ratio for the minimum latency problem, Proc. 7th ACM-SIAM SODA, (1996), pp. 152-157.
11. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal 45 (1966), pp. 1563-1581.
12. R. Motwani, S. Phillips and E. Torng, Non-clairυoyant scheduling, Proc. 4th ACM-SIAM SODA (1993), pp. 422-431, see also: Theoretical Computer Science, 130 (1994), pp. 17-47.
13. A.C. Yao, Probabilistic computations: Towards a unified measure of complexity, Proc. 17th IEEE FOCS (1977), pp. 222-227.