Balancing load under large and fast load changes in distributed computing systems — A case study

  • Thierry Le Sergent
  • Bernard Berthomieu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 854)


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.


Arrival Rate Load Balance Service Rate Distribute Computing System Loaded Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Barak and A. Shiloh. A distributed load-balancing policy for a multicomputer. Software Practice and Experience, 15(9):901–913, September 1985.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    Bernard Berthomieu, Didier Giralt, and Jean Paul Gouyon. LCS users manual. Rapport de Recherche 91226, CNRS-LAAS, Septembre 1991.Google Scholar
  5. 5.
    R. M. Bryant and R. A. Finkel. A stable distributed scheduling algorithm. In 2nd Int. Conf. Distributed Comput. Syst., pages 314–323, 1981.Google Scholar
  6. 6.
    A. Corradi, L. Leonardi, and F. Zambonelli. Load balancing strategies for massively parallel architectures. Parallel Processing Letters, 2(2 & 3):139–148, 1992.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    John A. Stankovic. Stability and distributed scheduling algorithms. IEEE Transactions on Sftware Engineering, 11(10):1141–1152, October 1985.Google Scholar
  13. 13.
    Yung-Terng Wang and Robert J. T. Morris. Load sharing in distributed systems. IEEE Transactions on Computers, C-34(3):204–217, March 1985.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    Songnian Zhou. A trace-driven simulation study of dynamic load balancing. IEEE Transactions on Software Engineering, 14(9):1327–1341, September 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Thierry Le Sergent
    • 1
  • Bernard Berthomieu
    • 2
  1. 1.LFCSUniversity of EdinburghEdinburghUK
  2. 2.LAAS/CNRSToulouse CedexFrance

Personalised recommendations