Using differential equations, we examine the GREEDY algorithm studied by Azar, Broder, Karlin and Upfal for distributed load balancing [1]. This approach yields accurate estimates of the actual load distribution, provides insight into the exponential improvement GREEDY offers over simple random selection, and allows one to prove tight concentration theorems about the loads in a straightforward manner.
No takes yet. Share an insight, caveat, or question.
Michael Mitzenmacher (1999) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: