On-line load balancing with applications to machine scheduling and virtual circuit routing
暂无分享,去创建一个
Amos Fiat | Yossi Azar | Serge A. Plotkin | James Aspnes | Orli Waarts | J. Aspnes | Y. Azar | A. Fiat | Orli Waarts
[1] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[2] Jeffrey M. Jaffe,et al. Algorithms for Scheduling Tasks on Unrelated Processors , 1981, JACM.
[3] Joseph Y. Hui. Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..
[4] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[5] Richard J. Gibbens,et al. Effective bandwidths for the multi-type UAS channel , 1991, Queueing Syst. Theory Appl..
[6] K. G. Ramakrishnan,et al. On-line routing for permanent virtual circuits , 1995, Proceedings of INFOCOM'95.
[7] Bala Kalyanasundaram,et al. On-Line Load Balancing of Temporary Tasks , 1993, J. Algorithms.
[8] Prabhakar Raghavan,et al. Provably good routing in graphs: regular arrays , 1985, STOC '85.
[9] Jeffrey M. Jaffe,et al. Efficient Scheduling of Tasks without Full Use of Processor Resources , 1980, Theor. Comput. Sci..
[10] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[11] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[12] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[13] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[14] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[15] Frank P. Kelly,et al. Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..
[16] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[17] G. Weiss,et al. Approximation results in parallel machnies stochastic scheduling , 1991 .
[18] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[19] David P. Williamson,et al. Scheduling Parallel Machines On-Line , 1995, SIAM J. Comput..
[20] David B. Shmoys,et al. Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[21] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.