The design of an efficient load balancing algorithm employing block design

Authors:
Ilyong Chung;Yongeun Bae
Affiliations:
Department of Computer Engineering, Chosun University, Kwangju, Korea;Department of Computer Engineering, Chosun University, Kwangju, Korea
Venue:
Journal of Applied Mathematics and Computing
Year:
1986

Citing 7
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on network. This processing 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 a symmetric balanced incomplete block design, where v = k2 + k + 1. Our algorithm needs only O(v√v) communication 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.