Cybenko [14] suggested a dimension exchange algorithm, in which the edges of the graph are colored so that no two edges of the same color share a vertex. Pairs of processors having the same color were grouped and a processor pair with load and exchange their load, after which each has the load . The algorithm was proved to converge in steps if the graph considered was a hypercube with dimension . Xu and Lau [88,89] extended the dimension exchange algorithm so that after the exchange processor has load . If this is equivalent to Cybenko's algorithm. Based on an eigenvalue analysis of the underlining iterative matrices, they argued that for some graph a factor other than gives better convergence. On a graph with small connectivity, this algorithm suffers in convergence in the same way as the diffusion algorithm.