A Comparison of Dynamic Load Balancing Algorithms

Distributed computing has the potential for running large-scale applications using heterogeneous and geographically distributed resources. However, a number of major technical issues must be handled before the full potential of distributed computing can be realized. Efficient job scheduling is a major prerequisite for the effective utilization of resources.Dynamic load balancing is the core of an efficient job scheduler. This paper describes the features of a Javabased simulator intended to analyze the performance of three load balancing algorithms, namely: senderinitiated,receiver-initiated and symmetrically-initiated algorithms using Average Waiting Time (AWT) and Average Turnaround Time (ATT) as criteria.Simulation results revealed that the symmetricallyinitiated algorithm performs better in almost all cases.