Abstract
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) |
|---|---|
| Pages (from-to) | 573-578 |
| Number of pages | 6 |
| Journal | IEEE Symposium on Parallel and Distributed Processing - Proceedings |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA Duration: Apr 15 1996 → Apr 19 1996 |
ASJC Scopus subject areas
- General Engineering
Fingerprint
Dive into the research topics of 'Distributing tokens on a hypercube without error accumulation'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS