Distributing tokens on a hypercube without error accumulation

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

Distributing tokens on a hypercube without error accumulation

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

Research output: Contribution to journal › Conference article › peer-review

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

Cite this

@article{6dccac3508754c479f546710203810cf,

title = "Distributing tokens on a hypercube without error accumulation",

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.",

author = "Chlebus, {Bogdan S.} and Rolim, {Jose D.P.} and Giora Slutzki",

year = "1996",

language = "English (US)",

pages = "573--578",

journal = "IEEE Symposium on Parallel and Distributed Processing - Proceedings",

issn = "1063-6374",

note = "Proceedings of the 1996 10th International Parallel Processing Symposium ; Conference date: 15-04-1996 Through 19-04-1996",

}

TY - JOUR

T1 - Distributing tokens on a hypercube without error accumulation

AU - Chlebus, Bogdan S.

AU - Rolim, Jose D.P.

AU - Slutzki, Giora

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029710842&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029710842&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0029710842

SN - 1063-6374

SP - 573

EP - 578

JO - IEEE Symposium on Parallel and Distributed Processing - Proceedings

JF - IEEE Symposium on Parallel and Distributed Processing - Proceedings

T2 - Proceedings of the 1996 10th International Parallel Processing Symposium

Y2 - 15 April 1996 through 19 April 1996

ER -

Distributing tokens on a hypercube without error accumulation

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this