The problem of load balancing on the hypercube is considered. A number of tokens are placed at the nodes and the goal is to redistribute them evenly throughout the network. Initially each of the p nodes stores up to m tokens. A simple algorithm is presented operating in time O(log p + m · log log p) on average.
|Original language||English (US)|
|Number of pages||6|
|Journal||IEEE Symposium on Parallel and Distributed Processing - Proceedings|
|Publication status||Published - Jan 1 1996|
|Event||Proceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA|
Duration: Apr 15 1996 → Apr 19 1996
ASJC Scopus subject areas