Christopher Wastell

Learn More
A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where <i>m</i> balls (tasks) are to be distributed to <i>n</i> bins (servers). In a seminal work, [Azar et al.; JoC'99] proposed the(More)
  • 1