Abstract
Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hydro-dynamic theory, to model load balance in server grids. Base on the BLQ model, we claim that if the system is in the state of global fairness, then the performance of the whole system is the best. We propose a load balanced algorithm based on the model: the algorithm tries its best to keep the system in the global fairness status using job deviation. We present three strategies: best node, best neighbour, and random selection, for job deviation. A number of experiments are conducted for the comparison of the three strategies, and the results show that the best neighbour strategy is the best among the proposed strategies. Furthermore, the proposed algorithm with best neighbour strategy is better than the traditional round robin algorithm in term of processing delay, and the proposed algorithm needs very limited system information and is robust.
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
Azar, Y., Broder, A.Z., Karlin, A.R., Eli, Upfal.: Balanced Allocations. SIAM J. COMPUT. 29(1), 180–200 (1999)
Drinea, E., Frieze, A., Mitzenmacher, M.: Balls and Bins Models with Feedback. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 308–315 (2002)
Joshi, B.S., Hosseini, S., Vairavan, K.: On a load balancing algorithm based on edge coloring. In: Proceedings of the 29th Southeastern Symposium on System Theory, pp. 174–178 (1997)
Liu, J., Kit, H.C., Hamdi, M., Tsui, C.Y.: Stable Round-Robin Scheduling Algorithms for High-Performance Input Queued Switches. In: Proceedings of the 10th Symposium on High Performance Interconnects Hot Interconnects (2002)
Hui, C.-C., Chanson, S.T.: A hydro-dynamic approach to heterogeneous dynamic load balance in a network of computers. In: Proceedings of the 1996 International Conference on Parallel Processing, pp. III–140–147 (1996)
Hui, C.-C., Chanson, S.T.: Efficient load balancing in interconnected LANs using group communication. In: Proceedings of the 17th International Conference on Distributed Computing Systems, pp. 141–148 (1997)
Jia, W., Zhou, W., Kaiser, J.: Efficient Algorithm for Mobile Multicast Using Anycast Group. IEE Proc.-Commun. 148(1) (February 2001)
Marostis, T., Molnar, S., Sztrik, J.: CAC Algorithm Based on Advantage Round Robin Method for Qos Networks. In: Proceedings of the Sixth IEEE Symposium on Computers and Communications (2001)
Mitzenmacher, M.: Load balancing and dependent jump markvo processes. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 213–222 (1996)
Mitzenmacher, M.: The Power of Two Choices in Randomized Load Balancing, Ph.D thesis (1997)
Partridge, C., Mendez, T., Milliken, W.: Host Anycasting Service,RFC 1546 (November 1993)
Wang, J., Levy, Y.: Managing Performance Using Weighted Round-Robin. In: Proceedings of the Fifth IEEE Symposium on Computers & Communications (2000)
Xuan, D., Jia, W., Zhao, W., Zhu, H.: A Routing Protocol for Anycast Message. IEEE Transaction on Parallel and Distributed System 11(6) (June 2000)
Yu, S., Zhou, W., Huang, F., Lan, M.: An Efficient Algorithm for Application-Layer Anycasting. In: Plaice, J., Kropf, P.G., Schulthess, P., Slonim, J. (eds.) DCW 2002. LNCS, vol. 2468, pp. 74–83. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, S., Casey, J., Zhou, W. (2004). A Load Balancing Algorithm for Web Based Server Grids. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive