In this paper, the problem of distributing load of a particular node over m identical nodes of a
distributed computing system for minimizing turnaround time is studied first. Then an efficient …

The authors propose two dynamic load balancing methods which give consideration to
network delays in a large‐scale, wide‐area distributed system. In general in load balancing …

For load balancing process in a distributed network consisting of v nodes it requires O (v 2)
communication complexity. Here we present a new synchronous dynamic distributed load …

It is desirable in a distributed system to have the system load balanced evenly among the
nodes so that the mean job response time is minimized. In this paper, we present a dynamic …

In distributed computing system some nodes are very fast and some are slow and during the
computation many fast nodes become idle or under loaded while the slow nodes become …

A sliding strategy for load balancing is introduced. The strategy groups a certain number of
adjacent nodes to perform a load balancing process. Upon the completion of a given period …

In this paper, we present a new dynamic, and adaptive distributed load balancing algorithm.
This algorithm is able to handle the loss of some computational nodes, the connectivity of …

Load balancing is a task scheduling scheme for distributed computing systems, that transfer
OT idle PTO-cessors to balance workload so that average response time can be reduced …

The study investigates various load balancing strategies to improve the performance of
distributed computer systems. A static task allocation and a number of dynamic load …

Load balancing algorithm can efficiently improve the performance of a distributed computing
system than the system without load balancing algorithm. Dynamic load balancing algorithm …