Abstract
In a hierarchical server environment, jobs must be assigned in an online fashion to a collection of servers forming a hierarchy of capability. Each job requests a specific server meeting its needs but the system is free to assign it either to that server or to any other server higher in the hierarchy. Each job carries a certain load, which it imparts to the server to which it is assigned. The goal is to minimize the maximum total load on a server.
We consider the linear hierarchy, where the servers are totally ordered in terms of capability, and the tree hierarchy, where ancestors are more powerful than their descendants. We investigate several variants of the problem, differing from one another by whether jobs are weighted or unweighted; whether they are permanent or temporary; and whether assignments are fractional or integral.We derive upper and lower bounds on the competitive ratio.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Albers. Better bounds for online scheduling. Proc. 29th ACM Symp. on Theory of Computing, pp. 130–139, 1997.
J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waartz. On-line machine scheduling with applications to load balancing and virtual circuit routing. Journal of the ACM, 44:486–504, 1997.
Y. Azar. On-line load balancing. On-line Algorithms: The State of the Art, Eds. A. Fiat and G. Woeginger, LNCS 1442, pp. 178–195, Springer, 1998.
Y. Azar, A. Broder, and A. Karlin. On-line load balancing. Proc. 33rd IEEE Symp. on Foundations of Computer Science, pp. 218–225, 1992.
Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. Journal of Algorithms, Vol. 22, pp. 93–110, 1997.
Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. Journal of Algorithms, Vol. 18, pp. 221–237, 1995.
Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. Newalgorithms for an ancient scheduling problem. Proc. 24th ACM Symp. on Theory of Computing, pp. 51–58, 1992.
Y. Bartal, H. J. Karloff, and Y. Rabani. A Better Lower Bound for On-line Scheduling. Information Processing Letters, 50:113–116, 1994.
P. Berman, M. Charikar, and M. Karpinski. On-line load balancing for related machines. 5th International Workshop on Algorithms and Data Structures’ 97, LNCS 1272, pp. 116–125, Springer, 1997.
R. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, Vol. 45, pp. 1563–1581, 1966.
D. R. Karger, S. J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pp. 132–140, 1994.
J. Sgall. On-line scheduling. On-line Algorithms: The State of the Art, Eds. A. Fiat and G. Woeginger, LNCS 1442, pp. 196–231, Springer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar-Noy, A., Freund, A., Naor, J.(. (1999). On-Line Load Balancing in a Hierarchical Server Topology. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive