A load-balancing algorithm for N-cubes

A parallel scheduling algorithm for N-cube networks is presented. This algorithm can fully balance the load and maximize locality by using global load information. Communication costs are significantly reduced compared to other existing algorithms.