An efficient load balancing algorithm employing a symmetric balanced incomplete block design

Authors:
Okbin Lee;Sangho Lee;Seongyeol Kim;Ilyong Chung
Affiliations:
Department of Computer Science, Chung-buk University, Korea;Department of Computer Science, Chung-buk University, Korea;School of Computer and Information, Ulsan College, Ulsan, Korea;Dept. of Computer Science, Chosun University, Kwangju, Korea
Venue:
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Year:
2003

Citing 7
Cited 2

Analysis of a graph coloring based distributed load balancing algorithm

Journal of Parallel and Distributed Computing
Hydrodynamic 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
The design of a conference key distribution system employing a symmetric balanced incomplete block design

Information Processing Letters
Scheduling and Load Balancing in Parallel and Distributed Systems

Scheduling and Load Balancing in Parallel and Distributed Systems
Strategies for Dynamic Load Balancing on Highly Parallel Computers

IEEE Transactions on Parallel and Distributed Systems

Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

Automation and Remote Control
Distributed full switch as an ideal system area network for multiprocessor computers

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to maintain load balancing in distributed system, should obtain workload information from all the nodes on network. It requires O(v2) communication overhead, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k + 1, 1)-configured network applying symmetric balanced incomplete block design, where v = k2 + k + 1. Our algorithm needs only O(v√v) message overhead and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.