The design and analysis of an efficient load balancing algorithm employing the symmetric balanced incomplete block design

Authors:
Okbin Lee;Seongjin Yoo;Byungjeon Park;Ilyong Chung
Affiliations:
Department of Computer Science, Chosun University, Gwangju 501-759, Republic of Korea;Department of Computer Science, Chosun University, Gwangju 501-759, Republic of Korea;Department of Computer Science, Chosun University, Gwangju 501-759, Republic of Korea;Department of Computer Science, Chosun University, Gwangju 501-759, Republic of Korea
Venue:
Information Sciences: an International Journal
Year:
2006

Citing 7
Cited 1

On Runtime Parallel Scheduling for Processor Load Balancing

IEEE Transactions on Parallel and Distributed Systems
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
Mapping and Load-Balancing Iterative Computations

IEEE Transactions on Parallel and Distributed Systems
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing

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 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(vv) 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 revised for distributed networks and is analyzed in terms of efficiency of load balancing.