Application of load balancing based on symmetric balanced incomplete block design to random networks

Authors:
Okbin Lee;Yeojin Lee;Seongyeol Kim;Sangman Moh;Ilyong Chung
Affiliations:
Department of Computer Science and Engineering, Chosun University, Kwangju, Republic of Korea;Department of Computer Science and Engineering, Chosun University, Kwangju, Republic of Korea;Department of Information Engineering, Ulsan College, Ulsan, Republic of Korea;Department of Computer Science and Engineering, Chosun University, Kwangju, Republic of Korea;Department of Computer Science and Engineering, Chosun University, Kwangju, Republic of Korea
Venue:
Information Sciences: an International Journal
Year:
2008

Citing 8
Cited 1

On Runtime Parallel Scheduling for Processor Load Balancing

IEEE Transactions on Parallel and Distributed Systems
Synchronous load balancing in hypercube multicomputers with faulty nodes

Journal of Parallel and Distributed Computing
Parallel Processing of Adaptive Meshes with Load Balancing

IEEE Transactions on Parallel and Distributed Systems
Decentralized Load Balancing on Unstructured Peer-2-Peer Computing Grids

NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Dynamic Load Balancing for the Distributed Mining of Molecular Structures

IEEE Transactions on Parallel and Distributed Systems
Dynamic load balancing experiments in a grid

CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
On the accuracy of two analytical models for evaluating the performance of Gigabit Ethernet hosts

Information Sciences: an International Journal
A multi-model algorithm for the cost-oriented design of Internet-based systems

Information Sciences: an International Journal

Convergence of the dynamic load balancing problem to Nash equilibrium using distributed local interactions

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

In a load balancing algorithm [O. Lee, M. Anshel, I. Chung, Design of an efficient load balancing algorithm on distributed networks by employing symmetric balanced incomplete block design, IEE Proceedings - Communications 151 (6) (2004) 535-538] based on the SBIBD (Symmetric Balanced Incomplete Block Design), each node receives global workload information by only two round message exchange with O(vv) traffic overhead, where v is the number of nodes. It is very efficient and works well only when v=p^2+p+1 is used for a prime number p. In this paper, we generated a special incidence structure using the SBIBD and then propose a new load balancing algorithm, which executes well for an arbitrary number of nodes. To accomplish this, we add a number of links to nodes in order for each node to receive more than 80% of the workload information by two round message exchange. For performance of our algorithm, we carried out an experiment for the number of nodes, w, which was up to 5000. Traffic overhead is less than ww in a round and standard deviation of traffic overhead shows that each node has a mostly well-balanced amount of traffic.