A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Distributing tokens on a hypercube without error accumulation
Proceedings of International Conference on Parallel Processing
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(logp + m log log p) on average. Introduction A distributed-memory multicomputer system consists of nodes interconnected by a message-passing network. The nodes are processing elements capable of performing autonomousdoi:10.1109/ipps.1996.508114 dblp:conf/ipps/ChlebusRS96 fatcat:p7xenonwurfr3injgam4gy3c44