Performance Characteristics of a Load Balancing Algorithm

this paper we examine and extend some properties of a novel graphcoloring based load balancing algorithm proposed by the authors in [6]. A formal analysis of the algorithm was presented in [5]. A main contribution of this paper is to make a connection between that analysis and a commonly used performance measure - the average response time. We also extend an optimality result proved in [5] where we showed that one (linear) version of the algorithm is optimal for binary n-cubes. In this paper we consider a generalization of the binary n-cubes that we call Hamming graphs, and show that the linear version is optimal for this larger class of graphs as well. In section 2 we review the two versions of the load balancing algorithm. In section 3 we consider performance measures for the algorithm, including the commonly used measure of average response time. In section 4 we consider the generalization of our prior work to the more general class of binary Hamming graphs. 2 A Load Balancing Algorith