Abstract
This paper discusses a load balancing technique for distributed processing systems in which the load may vary over a wide range and at a high rate. Each processor performs a source or server algorithm for migrating processes when its load crosses some assigned upper or lower bound; these bounds are dynamically adjusted. Taking into account the speed at which loads vary and the latency of the underlying network, we specify conditions under which the algorithm is stable and responds satisfactorily to fast load changes. Simulation confirms the validity of these conditions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Barak and A. Shiloh. A distributed load-balancing policy for a multicomputer. Software Practice and Experience, 15(9):901–913, September 1985.
Guy Bernard, Dominique Steve, and Michel Simatic. Placement et migration de processus dans les systèmes répartis faiblement couplés. TSI, 10(5):375–392, 1991.
B. Berthomieu and T. Le Sergent. Programming with behaviors in an ML framework: the syntax and semantics of LCS. In European Symposium On Programming, April 1994. Edinburgh, Scotland.
Bernard Berthomieu, Didier Giralt, and Jean Paul Gouyon. LCS users manual. Rapport de Recherche 91226, CNRS-LAAS, Septembre 1991.
R. M. Bryant and R. A. Finkel. A stable distributed scheduling algorithm. In 2nd Int. Conf. Distributed Comput. Syst., pages 314–323, 1981.
A. Corradi, L. Leonardi, and F. Zambonelli. Load balancing strategies for massively parallel architectures. Parallel Processing Letters, 2(2 & 3):139–148, 1992.
D. L. Eager, E. D. Lazowska, and J. Zahorjan. Adaptative load sharing in homogenous distributed systems. IEEE Trans. on Soft. Engineering, SE-12(5):662–675, May 1986.
Thierry Le Sergent. Méthodes d'exécution, et machines virtuelles parallèles pour l'implantation distribuée du langage de programmation parallèle LCS. Thèse de doctorat de l'Université Paul Sabatier, Toulouse, Février 1993.
Cathy Mccann, Raj Vaswani, and John Zahorjan. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Transactions on Computer Systems, 11(2):146–178, May 1993.
L. M. Ni, S. Xu, and T. Gendreau. A distributed drafting algorithm for load balancing. IEEE Transactions on Software Engineering, SE-11(10):1153–1161, October 1985.
K. G. Shin and Y. Chang. Load sharing in distributed real-time systems with state-change broadcasts. IEEE Transactions on Computers, 38(8):1124–1142, August 1989.
John A. Stankovic. Stability and distributed scheduling algorithms. IEEE Transactions on Sftware Engineering, 11(10):1141–1152, October 1985.
Yung-Terng Wang and Robert J. T. Morris. Load sharing in distributed systems. IEEE Transactions on Computers, C-34(3):204–217, March 1985.
J. Xu and K. Hwang. Heuristic methods for dynamic load balancing in a message-passing multicomputer. Journal of Par. and Dist. Computing, 18(1):1–13, May 1993.
Songnian Zhou. A trace-driven simulation study of dynamic load balancing. IEEE Transactions on Software Engineering, 14(9):1327–1341, September 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Sergent, T., Berthomieu, B. (1994). Balancing load under large and fast load changes in distributed computing systems — A case study. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_74
Download citation
DOI: https://doi.org/10.1007/3-540-58430-7_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58430-8
Online ISBN: 978-3-540-48789-0
eBook Packages: Springer Book Archive