A new step toward load balancing based on competency rank and transitional phases in Grid networks

Grid computing is a network of software–hardware capabilities. It serves as a comprehensive and complete system for organizations by which the maximum utilization from resources is achieved. Resource distribution in a heterogeneous and unstable environment and also effective load distribution among these resources are the important and difficult problems in Grid networks. Using dynamic and static algorithms or searching tree and Branch and Bound algorithm are considered to be among the available methods to reach the load balancing in Grid networks. This paper presents a new method for dynamic load balancing. In this method, we use the subtraction of forward and backward ants as a competency rank to take the priority of the sites, and we use a control word to search the suitable resource as well. Our main purpose is to devote jobs to the existing resources based on their processing power. Simulation results show that the proposed method can reduce the total completion time and also total tardiness to get the load balancing. The cost of using resources as an effective factor in load balancing is also observed.

► This paper presents a new method for dynamic load balancing.
► Our method uses the control word to search the suitable resource and jobs.
► Jobs are devoted to the existing resources based on their processing power.
► The subtraction of forward and backward ants is used as a competency rank.
► The proposed method can reduce the execution time for getting the load balancing.