Randomized Load Balancing
Randomized Load Balancing is a load distribution strategy that belongs to the class of randomized algorithms, distinguished by its use of probabilistic decision-making to assign tasks to resources in order to achieve balanced utilization with high probability while minimizing coordination overhead.
43
Publications
3.3K
Citations
64
Authors
40
Institutions
Publications per year
2017–2026
3
Parents
43
1–5 of 43
64
7
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 64
40
University of California, Berkeley
Berkeley, United States
5 h-index
10 publications
653 citations
Stanford University
Stanford, United States
5 h-index
6 publications
498 citations
Wayne State University
Detroit, United States
4 h-index
8 publications
102 citations
Microsoft (United States)
Redmond, United States
3 h-index
3 publications
238 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
4 publications
453 citations

University of Minnesota
Minneapolis, United States
3 h-index
3 publications
400 citations
Arizona State University
Tempe, United States
2 h-index
3 publications
253 citations

International Computer Science Institute
Berkeley, United States
2 h-index
3 publications
191 citations
1–8 of 40
Conference · 2 publications · 60 citations
2
h-index
2 publications · 82 citations
2
h-index
1 publications · 30 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
JON · 1 publications · 34 citations
1
h-index
1–5