The generalized packet routing problem
Theoretical Computer Science
The token distribution problem
SIAM Journal on Computing
Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A note on the token distribution problem
Information Processing Letters
Load balancing and routing on the hypercube and related networks
Journal of Parallel and Distributed Computing
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Tight analyses of two local load balancing algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Strongly Adaptive Token Distribution
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
An Efficient Algorithm for Perfect Load Balancing on Hypercube Multiprocessors
The Journal of Supercomputing
A perfect load balancing algorithm on cube-connected cycles
CIMMACS'06 Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics
| Hi-index | 0.00 |
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\cdot\log\log p) on average.