Hypercube Network Load Balancing
Hypercube Network Load Balancing is a distributed algorithmic strategy that optimally distributes computational tasks across the nodes of a hypercube network by minimizing processing imbalances through efficient inter-node communication and dynamic resource reallocation.
42
Publications
1.3K
Citations
101
Authors
56
Institutions
Publications per year
2017–2026
2
Parents
42
A stochastic process on the hypercube with applications to peer-to-peer networks
Micah Adler, Eran Halperin, Richard M. Karp et al. · 2003 · 95 citations
Matching preclusion for balanced hypercubes
Huazhong Lü, Xianyue Li, Heping Zhang · Theoretical Computer Science · 2012 · 78 citations · Full text
Load balancing in large networks: a comparative study
Reinhard Lüling, Burkhard Monien, F. Ramme · 2002 · 74 citations
1–5 of 42
101
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 101
56
University of California, Berkeley
Berkeley, United States
3 h-index
4 publications
277 citations
University of Michigan
Ann Arbor, United States
2 h-index
2 publications
43 citations
Stanford University
Stanford, United States
2 h-index
2 publications
114 citations

Pennsylvania State University
State College, United States
2 h-index
4 publications
82 citations
Yale University
New Haven, United States
2 h-index
5 publications
129 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
3 publications
47 citations
Friedrich Schiller University Jena
Jena, Germany
2 h-index
2 publications
48 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
4 publications
163 citations
1–8 of 56
3 publications · 47 citations
3
h-index
2 publications · 84 citations
2
h-index
1 publications · 13 citations
1
h-index
1 publications · 75 citations
1
h-index
1 publications · 25 citations
1
h-index
1–5