Abstract
A centralized scheduler must assign tasks to servers, processing on-line a sequence of task arrivals and departures. Each task runs for an unknown length of time, but comes with a weight that measures resource utilization per unit time. The response time of a server is the sum of the weights of the tasks assigned to it. The goal is to minimize the maximum response time, i.e., load, of any server. Previous papers on on-line load balancing have generally concentrated only on keeping the current maximum load bounded by some function of the maximum off-line load ever seen. Our goal is to keep the current maximum load on an on-line server bounded by a function of the current off-line load. Thus the loads are not permanently skewed by transient peaks, and the algorithm takes advantage of reductions in total weight. To achieve this, the scheduler must occasionally reassign tasks, in an attempt to decrease the maximum load. We study several variants of load balancing, including identical machines, related machines, restricted assignment tasks, and virtual circuit routing. In each case, only a limited amount of reassignment is used but the load is kept substantially lower than possible without reassignment.
Preview
Unable to display preview. Download preview PDF.
References
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 Symp. on Theory of Computing, pages 623–631, 1993.
B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proc. ACM/SIAM Symp. on Discrete Algorithms, pages 321–330, 1994.
Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. Online load balancing of temporary tasks. In Proc. 1993 Workshop on Algorithms and Data Structures (WADS 93), Lecture Notes in Computer Science 709. Springer-Verlag, Aug. 1993.
Y. Azar, A. Karlin, and A. Broder. On-line load balancing. In Proc. 33nd Symp. of Fundations of Computer Science, pages 218–225, 1992.
Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. In Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, pages 203–210, 1992.
Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. In Proc. 24nd ACM Symp. on Theory of Computing, 1992.
R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563–1581, 1966.
D. R. Karger, S. J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. In Proc. 1994 ACM/SIAM Symp. on Discrete Algorithms, 1994. To appear.
E. L. Lawler, J. K. Lenstra, A. H. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. Rinnooy Kan, and P. Zipkin, editors, Handbook of Operations Research and Management Science, Volume IV: Production Planning and Inventory, pages 445–522. North-Holland, 1993.
S. Phillips and J. Westbrook. On-line load balancing and network flow. In Proc. 1993 Symp. on Theory of Computing, pages 402–411, Apr. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Westbrook, J. (1995). Load balancing for response time. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_155
Download citation
DOI: https://doi.org/10.1007/3-540-60313-1_155
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60313-9
Online ISBN: 978-3-540-44913-3
eBook Packages: Springer Book Archive