This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hydrodynamic Load Balancing
November 1999 (vol. 10 no. 11)
pp. 1118-1137

Abstract—This paper presents a hydrodynamic framework to solving the dynamic load balancing problem in heterogeneous distributed systems. In this approach, each processor is viewed as a liquid cylinder where the cross-sectional area corresponds to the capacity of the processor, the communication links are modeled as liquid channels between the cylinders, the workload is represented by liquid, and the load balancing algorithm manages the flow of the liquid. It is proven that all algorithms under this framework converge geometrically to the state of equilibrium, in which the heights of the liquid columns are the same in all the cylinders. In this way, each processor obtains an amount of workload proportional to its capacity. A hydrodynamic algorithm is presented and its performance is evaluated. The algorithm is applied to solve several practical applications to demonstrate the applicability of the framework.

[1] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[2] J. Boillat, “Load Balancing and Poisson Equation in a Graph,” Concurrency: Practice and Experience, vol. 2, pp. 289-313, 1990.
[3] R.M. Bryant and R.A. Finkel, “A Stable Distributed Scheduling Algorithm,” Proc. Second Int'l Conf. Distributed Computing Systems, pp. 314–323, 1981.
[4] T.L. Casavant and J.G. Kuhl, “Effects of Response and Stability on Scheduling in Distributed Computing Systems,” IEEE Trans. Software Eng., vol. 14, no. 11, pp. 1,578-1,588, Nov. 1988.
[5] T.L. Casavant and J.G. Kuhl,“A taxonomy of scheduling in general-purpose distributed computing systems,” IEEE Trans. on Software Engineering, vol. 14, no. 2. Feb. 1988.
[6] G. Cybenko, "Dynamic Load Balancing for Distributed Memory Multiprocessors," J. Parallel and Distributed Computing, vol. 7, pp. 279-301, 1989.
[7] G. Cybenko, "Dynamic Load Balancing for Distributed Memory Multiprocessors," J. Parallel and Distributed Computing, vol. 7, pp. 279-301, 1989.
[8] C.-C. Hui, “Load Balancing in Multidomain Systems,” PhD thesis, The Hong Kong Univ. of Science and Tech nology, Aug. 1997.
[9] C.-C. Hui and S.T. Chanson, “A Hydrodynamic Approach to Heterogeneous Dynamic Load Balancing in a Network of Computer,” Proc. Int'l Conf. Parallel Processing, Vol. III, pp. 140–147, Aug. 1996.
[10] C.-C. Hui, M. Hamdi, and I. Ahmad, “SPEED: A Parallel Platform for Solving and Predicting the Performance of PDEs on Distributed Systems,” Concurrency: Practice and Experience, vol. 8, no. 7, pp. 537–568, Sept. 1996.
[11] J. JáJá and K.W. Ryu, “Load Balancing on the Hypercube and Related Networks,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 203–210, 1990.
[12] L.V. Kalé, “Comparing the Performance of Two Dynamic Load Distribution Methods,” Proc. Int'l Conf. Parallel Processing, pp. 8–12, 1988.
[13] P. Krueger and R. Chawla, "The Stealth Distributed Schedular," Proc. 11th Int'l Conf. Distributed Computing Systems, pp. 336-343, May 1991.
[14] F.C.H. Lin and R.M. Keller, “The Gradient Model Load Balancing Method,” IEEE Trans. Software Eng., vol. 13, no. 1, pp. 32-38, Jan. 1987.
[15] R. Luling, B. Monien, and F. Ramme, “Load Balancing in Large Networks: A Comparative Study,” Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 686-689, Dec. 1991.
[16] R. Luling, B. Monien, and F. Ramme, “Load Balancing in Large Networks: A Comparative Study,” Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 686-689, Dec. 1991.
[17] M.W. Mutka, "A Comparison of Workload Models of the Capacity Available for Sharing Among Privately Owned Workstations," Proc. 24th Ann. Hawaii Int'l Conf. System Sciences, pp. 353-362, Jan. 1991.
[18] X. Qian and Q. Yang, “Load Balancing on Generalized Hypercube and Mesh Multiprocessors with LAL,” Proc. 11th Int'l Conf. Distribuated Computing Systems, pp. 402–409, 1991.
[19] W. Shu and L.V. Kalé, “A Dynamic Scheduling Strategy for the Chare-Kernel System,” Proc. Supercomputing'89, pp. 389–398, Nov. 1989.
[20] J. Song, "A Partially Asynchronous and Iterative Algorithm for Distributed Load Balancing," Parallel Computing, vol. 20, pp. 853-868, 1994.
[21] J.A, Stankovic, “Stability and Distributed Scheduling Algorithms,” IEEE Trans. Software Eng., vol. 11, no. 10, pp. 1,141–11,52, Oct. 1985.
[22] M. Willebeck-LeMair and A. Reeves, “Strategies for Dynamic Load Balancing on Highly Parallel Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 9, pp. 979-993, Sept. 1993.
[23] C.Z. Xu and F.C.M. Lau, “Analysis of the Generalized Dimensions Exchange Method for Dynamkc Load Balancing,” J. Parallel and Distributed Computing, vol. 16, no. 4, pp. 385–393, Dec. 1992.
[24] C.Z. Xu and F.C.M. Lau, “Iterative Dynamic Load Balancing in Multicomputers,” J. Operational Research Soc., vol. 45, no. 7, pp. 786–796, July 1994.
[25] C.Z. Xu and F.C.M. Lau, “Optimal Parameters for Load Balancing with the Diffusion Method in Mesh Networks,” Parallel Processing Letters, vol. 4,nos. 1/2, pp. 139–147, June 1994.
[26] C.-Z. Xu and F.C.M. Lau, "The Generalized Dimension Exchange Method for Load Balancing in k-ary n-cubes and Variants," J. Parallel and Distributed Computing, vol. 24, no. 1, pp. 72-85, Jan. 1995.
[27] C.Z. Xu, F.C.M. Lau, and B. Monien, and R. Lüling, “Nearest-Neighbor Algorithms for Load-Balancing in Parallel Computers,” Concurrency: Practice and Experience, vol. 7, no. 7, pp. 707–736, Oct. 1995.

Index Terms:
Dynamic load balancing, geometric convergence, job scheduling, hydrodynamic system.
Citation:
Chi-Chung Hui, Samuel T. Chanson, "Hydrodynamic Load Balancing," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 11, pp. 1118-1137, Nov. 1999, doi:10.1109/71.809572
Usage of this product signifies your acceptance of the Terms of Use.