Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

A case study of an adaptive load balancing algorithm

Abstract

In this paper we present an effective load balancing algorithm for a multi-processor architecture designed for the real time switching of telephone calls. By modifying an algorithm developed for an abstract queueing model, which is of independent interest by itself, we propose a hybrid load balancing algorithm and study its performance in a simulation test-bed. This case study demonstrates how simple abstractions and theoretically intractable but intuitively appealing ideas can be combined to effectively solve a real problem.

This is a preview of subscription content, log in to check access.

References

  1. [1]

    A. K. Agrawala and S. K. Tripathi, On the optimality of semidynamic routing schemes, Info. Process. Lett. 13 (October 1981).

  2. [2]

    M. Bazaraa and C.M. Shetty,Nonlinear Programming, Theory and Algorithms (Wiley, New York, 1979).

  3. [3]

    P. Billingsley,Convergence of Probability Measures (Wiley, New York, 1968).

  4. [4]

    F. Bonomi and A. Kumar, Adaptive optimal load balancing in a heterogeneous multiserver system with a central job scheduler, to appear in IEEE Trans. Comput. (1990).

  5. [5]

    F. Bonomi and A. Kumar, Adaptive optimal load balancing in a heterogeneous multiserver system with a central job scheduler,Proc. 8th ICDCS, San José, CA (1988) pp. 500–509.

  6. [6]

    D. Eager, E. Lazowska and J. Zahorjan, Adaptive load sharing in homogeneous distributed systems, IEEE Trans. Software Eng. SE-12, no. 5 (1986) 662–675.

  7. [7]

    H.J. Kushner and D.S. Clark,Stochastic Approximation Methods for Constrained and Unconstrained Systems (Springer, New York, 1978).

  8. [8]

    H.J. Kushner and A. Shwartz, An invariant measure approach to the convergence of stochastic approximations with state dependent noise, SIAM J. Control Optimization 22, no. 1 (1984) 13–27.

  9. [9]

    N. Rau,Matrices and Mathematical Programming (St. Martin's Press, New York, 1981).

  10. [10]

    Y.T. Wang and R.T.J. Morris, Load sharing in distributed systems, IEEE Trans. Comput. C-34 (1985) 204–217.

  11. [11]

    J. W. West, III and T. D. Lynch,UNIX SIMSCRIPT II.5®User's Manual, CACI (January 1986).

  12. [12]

    T.P. Yum, The design and analysis of semidynamic deterministic routing rule, IEEE Trans. Commun. COM-29, no. 4 (1981) 498–504.

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bonomi, F., Doshi, B.T., Kaufman, J.S. et al. A case study of an adaptive load balancing algorithm. Queueing Syst 7, 23–49 (1990). https://doi.org/10.1007/BF01158784

Download citation

Keywords

  • Load balancing
  • queueing
  • multi-processor architecture
  • stochastic approximation
  • call processing