This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Albers. Better bounds for on-line scheduling. In Proc. 29th ACM Symp. on Theory of Computing, pages 130–139, 1997.
M. Andrews. Constant factor bounds for on-line load balancing on related machines. Manuscript.
M. Andrews, M. Goemans, and L. Zhang. Improved bounds for on-line load balancing. In COCOON'96, 1996.
J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. 25th ACM Symposium on the Theory of Computing, pages 623–631, 1993.
A. Avidor, Y. Azar, and J. Sgall. Ancient and new algorithms for load balancing in the l p norm. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pages 426–435, 1998.
B. Awerbuch, Y. Azar, E. Grove, M. Kao, P. Krishnan, and J. Vitter. Load balancing in the l p norm. In Proc. 36th IEEE Symp. on Found. of Comp. Science, pages 383–391, 1995.
B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 321–327, 1994.
Y. Azar, A. Broder, and A. Karlin. On-line load balancing. In Proc. 33rd IEEE Symposium on Foundations of Computer Science, pages 218–225, 1992.
Y. Azar and L. Epstein. On-line load balancing of temporary tasks on identical machines. In 5th Israeli Symposium on Theory of Computing and Systems, pages 119–125, 1997.
Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. Online load balancing of temporary tasks. In Workshop on Algorithms and Data Structures, pages 119–130, 1993.
Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. In Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 203–210, 1992.
Y. Azar and O. Regev. On-line bin stretching. Manuscript, 1997.
Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences, 51:359–366, 1995.
Y. Bartal, H. Karloff, and Y. Rabani. A better lower bound for on-line scheduling. Information Processing Letters, 50:113–116, 1994.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proc. 24rd International Colloquium on Automata, Languages, and Programming, 1997.
P. Berman, M. Charikar, and M. Karpinski. A note on on-line load balancing for related machines. In 5th Annual Workshop on Algorithms and Data Structures, pages 116–125, 1997.
R. Boppana and A. Floratos. Load balancing in the euclidean norm. Manuscript, 1997.
B. Chen, A. van Vliet, and G. J. Woeginger. Lower bounds for randomized online scheduling. Information Processing Letters, 51:219–222, 1994.
B. Chen, A. van Vliet, and G. J. Woeginger. New lower and upper bounds for on-line scheduling. Operations Research Letters, 16:221–230, 1994.
Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9:91–103, 1988.
G. Galambos and G. J. Woeginger. An on-line scheduling heuristic with better worst case ratio than graham's list scheduling. SIAM J. Computing, 22:349–355, 1993.
R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563–1581, 1966.
R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math, 17:263–269, 1969.
D. Hochbaum and D. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing, 17:539–551, 1988.
Dorit S. Hochbaum and David B. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. of the ACM, 34(1):144–162, January 1987.
P. Indyk, 1996. Personal communication.
D. R. Karger, S. J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. J. Algorithms, 20:132–140, 1996.
R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for online bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 352–358, Baltimore, Maryland, May 1990.
H. Kellerer, V. Kotov, M. G. Speranza, and Zs. Tuza. Semi on-line algorithms for the partition problem. Operations Research Letters, 1998. To appear.
J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Prog., 46:259–271, 1990.
S. Phillips and J. Westbrook. On-line load balancing and network flow. In Proc. 25th ACM Symposium on Theory of Computing, pages 402–411, 1993.
S. Plotkin and Y. Ma. An improved lower bound for load balancing of tasks with unknown duration. Manuscript.
S. Seiden. Randomized algorithms for that ancient scheduling problem. In 5th annual Workshop on Algorithms and Data Structures, pages 210–223, 1997.
J. Sgall. A lower bound for randomized on-line multiprocessor scheduling. Inforation Processing Letters, 63:51–55, 1997.
D. B. Shmoys, J. Wein, and D. P. Williamson. Scheduling parallel machines online. SIAM Journal on Computing, 24:1313–1331, 1995.
J. Westbrook. Load balancing for response time. In 3rd Annual European Symposium on Algorithms, 1995.
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Azar, Y. (1998). On-line load balancing. In: Fiat, A., Woeginger, G.J. (eds) Online Algorithms. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029569
Download citation
DOI: https://doi.org/10.1007/BFb0029569
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64917-5
Online ISBN: 978-3-540-68311-7
eBook Packages: Springer Book Archive