Efficient Load Balancing on Irregular Network Topologies Using B+tree Structures

In this study, a heterogeneous distributed computing environment (Grid) is employed as a computing platform to perform some computationally intensive tasks. In order to increase the efficiency of the system (utilization and average response time), a dynamic task scheduling algorithm is proposed to balance the load among the nodes of the system. The technique is composed of two main phases. Firstly, the heterogeneous distributed system is embedded onto a structure similar to B+tree and then the algorithm of load-balancing is executed on the virtual structure. The optimum degree of the tree is identified in order to achieve optimal performance. The experimental and simulation results show the benefit of using the technique and additionally they show that it is relatively easy to identify the crossover points (thresholds) for which the system should be load balanced.