On-line load balancing

Theoretical Computer Science - Tập 130 - Trang 73-84 - 1994
Yossi Azar1
1Computer Science Department, Tel Aviv University, Tel Aviv 69978, Israel

Tài liệu tham khảo

Azar, 1993, Online load balancing of temporary tasks, Workshop on Algorithms and Data Structures (WADS), 119, 10.1007/3-540-57155-8_241

Azar, 1992, The competitiveness of on-line assignment, Proc. 3rd Ann. ACM—SIAM SODA, 203

Bartal, 1992, New algorithms for an Ancient Scheduling Problem, Proc. 24th Ann. ACM Symp. on Theory of Computing, 51

Baruah, 1991, On-line scheduling in the presence of overload, Proc. 32nd IEEE Symp. on Foundations of Computer Science, 100, 10.1109/SFCS.1991.185354

Graham, 1966, Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45, 1563, 10.1002/j.1538-7305.1966.tb01709.x

Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math., 5, 287, 10.1016/S0167-5060(08)70356-X

Karp, 1990, An optimal algorithm for on-line bipartite matching, Proc. 22nd Ann. ACM Symp. on Theory of Computing, 352

Lovász, 1989, An on-line graph coloring algorithm with sublinear performance ratio, Discrete Math., 75, 319, 10.1016/0012-365X(89)90096-4

Phillips, 1993, Online load balancing and network flow, Proc. 25th Ann. ACM Symp. on Theory of Computing, 402

Shmoys, 1991, Scheduling parallel machines on-line, Proc. 32nd IEEE Symp. on Foundations of Computer Science, 131, 10.1109/SFCS.1991.185361

Vishwanathan, 1990, Randomized on-line graph coloring, Proc. 31st Ann. Symp. on Foundations of Computer Science, 464, 10.1109/FSCS.1990.89567

Thông tin
Thông tin xuất bản

Theoretical Computer Science

Tập 130

73-84

Thông tin tác giả