Performance Characteristics of a Load Balancing Algorithm

The behavior of a graph coloring-based, distributed load balancing algorithm for a network of processors is evaluated in terms of the average response time of the system. A fundamental correspondence between average response time and Euclidean system distance (a measure of load imbalance) is analytically demonstrated. This relationship leads to the proposal of tools intended to be used in the analysis of load balancing methods. Simulation studies were conducted and are found to support the theoretical results.