On a load balancing algorithm based on edge coloring

Abstract

Load balancing is the process of enhancing the performance of a distributed system through a redistribution of loads among the processors. In our earlier work a load balancing algorithm based on graph coloring for link-oriented structures was proposed and studied in detail. In this paper we modify the algorithm by introducing an important factor known as the damping factor, D. This factor is used to strike a balance between the runtime of the algorithm and the average response time. We observe that considerable improvement in system performance is possible with the application of the load balancing algorithm. The primary performance metric used is the average response time of the system. We express the analytical results in terms of upper and lower bounds on the average response time.