Abstract
In order to maintain load balancing in a distributed network, each node should obtain workload information from all the nodes in the network. To accomplish this, this processing requires O(v 2) communication complexity, where v is the number of nodes. First, we present a new synchronous dynamic distributed load balancing algorithm on a (v,k+1,1)-configured network applying a symmetric balanced incomplete block design, where v=k 2+k+1. Our algorithm designs a special adjacency matrix and then transforms it to (v,k+1,1)-configured network for an efficient communication. It requires only \(O(v \sqrt v)\) communication complexity and each node receives workload information from all the nodes without redundancy since each link has the same amount of traffic for transferring workload information. Later, this algorithm is reconstructed on distributed networks, where v is an arbitrary number of nodes and is analyzed in terms of efficiency of load balancing.
This research was supported by the Program for the Training of Graduate Students in Regional Innovation which was conducted by the Ministry of Commerce Industry and Energy of the Korean Government.
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
Hui, C., Chanson, S.: Hydrodynamic Load Balancing. IEEE Transactions on Parallel and Distributed System 10(11), 1118–1137 (1999)
Bharadwaj, V., Ghose, D., Robertazzi, T.: A New Paradigm for Load Scheduling in Distributed Systems. Cluster Computing 6(1), 7–18 (2003)
Legrand, A., et al.: Mapping and Load-Balancing Iterative Computing. IEEE Transactions on Parallel and Distributed System 15(6), 546–558 (2004)
Padlipsky, M.: A perspective on the ARPANET Reference Model. In: Proc. of INFOCOM. IEEE, Los Alamitos (1983)
Ford, L., Fulkerson, D.: Flow in Network. Princeton University Press, Princeton (1962)
Wu, M.: On Runtime Parallel Scheduling for processor Load balancing. IEEE Transactions on Parallel and Distributed System 8(2), 173–185 (1997)
Nam, K., Seo, J.: Synchronous Load balancing in Hypercube Multicomputers with Faulty Nodes. Journal of Parallel and Distributed Computing 58, 26–43 (1999)
Rim, H., Jang, J., Kim, S.: Method for Maximal Utilization of Idle links for Fast Load Balancing. Journal of Korea Information Science Society 28(12), 632–641 (2001)
Das, S., Harvey, D., Biswas, R.: Adaptive Load-Balancing Algorithms Using Symmetric Broadcast Networks. Journal of parallel and Distributed Computing 62(6), 1042–1068 (2002)
Das, S., Harvey, D., Biswas, R.: Parallel Processing of Adaptive Meshes with Load Balancing. IEEE Transactions on Parallel and Distributed Systems 12(12), 1269–1280 (2001)
Liu, C.L.: Introduction to Combinatorial Mathematics, pp. 359–383. McGraw-Hill, New York (1968)
Chung, I., Choi, W., Kim, Y., Lee, M.: The Design of conference key distribution system employing a symmetric balanced incomplete block design. Information Processing Letters 81(6), 313–318 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, Y., Lee, O., Choi, W., Youn, C., Chung, I. (2006). The Design of a Dynamic Efficient Load Balancing Algorithm on Distributed Networks. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_9
Download citation
DOI: https://doi.org/10.1007/11847366_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39368-9
Online ISBN: 978-3-540-39372-6
eBook Packages: Computer ScienceComputer Science (R0)