Distributing tokens on a hypercube without error accumulation

Bogdan S. Chlebus, Jose D.P. Rolim, Giora Slutzki

Research output: Contribution to journalConference article

5 Scopus citations


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 languageEnglish (US)
Pages (from-to)573-578
Number of pages6
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - Jan 1 1996
Externally publishedYes
EventProceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA
Duration: Apr 15 1996Apr 19 1996

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Distributing tokens on a hypercube without error accumulation'. Together they form a unique fingerprint.

  • Cite this