DocumentCode
2135011
Title
Distributing tokens on a hypercube without error accumulation
Author
Chlebus, Bogdan S. ; Rolim, Jose D P ; Slutzki, G.
Author_Institution
Inst. of Inf., Warsaw Univ., Poland
fYear
1996
fDate
15-19 Apr 1996
Firstpage
573
Lastpage
578
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 𝒪(log p+m·log log p) time on average
Keywords
computational complexity; hypercube networks; resource allocation; computation time; error accumulation; hypercube load balancing; hypercube nodes; token distribution; Broadcasting; Computational modeling; Computer science; Hypercubes; Joining processes; Load management; Network topology; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
Conference_Location
Honolulu, HI
Print_ISBN
0-8186-7255-2
Type
conf
DOI
10.1109/IPPS.1996.508114
Filename
508114
Link To Document