Stability analysis of a load balancing algorithm

Load balancing is the process of improving the performance of a system through a redistribution of loads among the processors. In this paper the authors present the stability analysis of a load balancing algorithm based on graph coloring. In this algorithm the processors use local knowledge for the purpose of load balancing. Unlike threshold based algorithms whose efficiency depends on the threshold level selected, the graph coloring based load balancing algorithm does not use any such global parameter. Furthermore, it uses the edge coloring concept to pair the processors. This avoids the selection/rejection operations encountered in many load balancing algorithms proposed in the literature. Also, there is no central controller and the algorithm is easily adaptable to changes in the system configurations.