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

Authors

64

  1. MM
    Michael Mitzenmacher

    Harvard University Press, United States

    7 publications · 1.8K citations

    7

    h-index

  2. BP
    Balaji Prabhakar

    Stanford University, United States

    4 publications · 420 citations

    4

    h-index

  3. CX
    Chengzhong Xu

    Wayne State University, United States

    4 publications · 51 citations

    4

    h-index

  4. HS
    Haiying Shen

    Clemson University, United States

    4 publications · 51 citations

    4

    h-index

  5. SC
    Soumen Chakrabarti

    Indian Institute of Technology Bombay, India

    4 publications · 209 citations

    4

    h-index

1–5 of 64

Venues

  1. Symposium on Discrete Algorithms

    Conference · 2 publications · 60 citations

    2

    h-index

  2. Random Structures and Algorithms

    2 publications · 82 citations

    2

    h-index

  3. 1

    h-index

  4. Bristol Research (University of Bristol)

    Repository · 1 publications · 11 citations

    1

    h-index

  5. Journal of Optical Networking

    JON · 1 publications · 34 citations

    1

    h-index

1–5