Neighbor´s load prediction for dynamic load balancing in a distributed computational environment

In distributed computing environment, divisible load technique is used to speedup the completion time of a parallel task by splitting a huge task into a smaller grain size jobs where jobs can be executed remotely by other nodes. Due to the heterogeneity of computing nodes, load balancing technique is employed to distribute workload evenly across distributed nodes in order to reduce the overall response time and maximize the resource utilization. Load information plays an important role in heterogeneous computing environment to formulate a job distribution decision. In this paper, we propose a dynamic load balancing algorithm where its information policy for those nodes that have an empty neighbors´ list to discover and predict other neighbors´ load information. Simulation results from various scenarios show that our approach able to reduce the overall average response time of each job.