To motivate this survey, we begin with a simple problem that demonstrates a powerful
fundamental idea. Suppose that n balls are thrown into n bins, with each ball choosing a bin …

This article deals with randomized allocation processes placing sequentially n balls into n
bins. We consider multiple-choice algorithms that choose d locations (bins) for each ball at …

In this survey we provide an overview of recent advances on scalable load balancing
schemes which provide favorable delay performance and yet require minimal …

We study a particular aspect of the balanced allocation paradigm (also known as the “two-
choices paradigm”): constant sized bins, packed as tightly as possible. Let d≥ 1 be fixed …

High performance applications involving large data sets require the efficient and flexible use
of multiple disks. In an external memory machine with D parallel, independent disks, only …

It is well known that if n balls are inserted into n bins, with high probability, the bin with
maximum load contains (1+ o (1)) logn/log log n balls. Azar, Broder, Karlin, and Upfal [1] …

This book presents the history and state of the art of universal routing strategies, which can
be applied to networks independently of their respective topologies. It opens with a self …

We consider a system of N servers inter-connected by some underlying graph topology GN.
Tasks with unit-mean exponential processing times arrive at the various servers as …

The ability of parallel computing to process large data sets and handle time-consuming
operations has resulted in unprecedented advances in biological and scientific computing …

We survey routing problems on fixed-connection networks. We consider many aspects of the
routing problem and provide known theoretical results for various communication models …