A fundamental problem in distributed computing is the distribution of requests to a set of uniformservers without a centralized controller. Classically, such problems are modelled as static balls intobins processes, where m balls (tasks) are to be distributed to n bins (servers). In a seminal work,Azar et al. [4] proposed the sequential strategy Greedy[d] for n = m. When thrown,...
