Abstract

Suppose that n balls are placed into n bins, each ball being placed into a bin chosen independently and uniformly at random. Then, with high probability, the maximum load in any bin is approximately log n log log n . Suppose instead that each ball is placed sequentially into the least full of d bins chosen independently and uniformly at random. It has recently been shown that the maximum load is then only log log n log d +O(1) with high probability. Thus giving each ball two choices instead of just one leads to an exponential improvement in the maximum load. This result demonstrates the power of two choices, and it has several applications to load balancing in distributed systems. In this thesis, we expand upon this result by examining related models and by developing techniques for stu...

Citations

8882	Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H - Garey, Johnson - 1979
1493	Random Graphs - Bollobas - 2001
1478	The probabilistic method - Spencer - 1992
448	Reversibility and Stochastic Networks - Kelly - 1979
403	Serverless network file systems - Anderson, Dahlin, et al. - 1996
358	Zahorjan, “Adaptive load sharing in homogeneous distributed systems - Eager, Lazowska, et al. - 1986
328	Queueing Systems. Volume I: Theory - Kleinrock - 1975
328	Introduction to Probability Models - Ross - 2010
316	Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1999
300	Stochastic modeling and the theory of queues - Wolff - 1989
210	Balanced allocations - Azar, Broder, et al. - 1994
190	A guided tour of Chernoff bounds - Hagerup, Rub - 1990
189	Weighted sums of certain dependent random variables - Azuma - 1967
130	Poisson Approximation - Barbour, Holst, et al. - 1992
130	A trace-driven simulation study of dynamic load balancing - Zhou
119	A comparison of receiver-initiated and sender-initiated adaptive load sharing - Eager, Lazowska, et al. - 1986
111	Large deviations for performance analysis - Shwartz, Weiss - 1995
110	Urn models and their applications - Johnson, Kotz - 1977
107	Approximation and Weak Convergence Methods for Random Processes with Applications to Stochastic Systems Theory, ser - Kushner - 1984
106	An optimal algorithm for online bipartite matching - Karp, Vazirani, et al. - 1990
99	The limited performance benefits of migrating active processes for load sharing - Eager, Lazowska, et al. - 1988
96	On-line load balancing - Azar - 1992
94	Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures Algorithms - Kamath, Motwani, et al. - 1995
93	The influence of different workload descriptions on a heuristic load balancing scheme - Kunz - 1991
87	R.: The competitiveness of on-line assignments - Azar, Naor, et al. - 1995
81	On the satisfiability and maximum satisfiability of random 3-CNF formulas - Broder, Frieze, et al. - 1993
81	auf der Heide. Efficient PRAM simulation on a distributed memory machine - Karp, Luby, et al. - 1992
79	Solutions of ordinary differential equations as limits of pure jump markov processes - Kurtz - 1970
71	Optimality of the shortest line discipline - Winston - 1977
70	Expected length of the longest probe sequence in hash code searching - Gonnet - 1981
67	Maximum matchings in sparse random graphs - Karp, Sipser - 1981
66	A simple load balancing scheme for task allocation in parallel machines - Rudolph, Slivkin-Allalouf, et al. - 1991
58	On-line load balancing of temporary tasks - Azar, Kalyanasundaram, et al. - 1993
57	Tensor Analysis, and Applications - Manifolds - 1988
51	Parallel randomized load balancing - Adler, Chakrabarti, et al. - 1998
47	Strong approximation theorems for density dependent Markov chains - Kurtz - 1978
47	Approximation of population processes - Kurtz - 1981
39	Multilevel Adaptive Hashing - Broder, Karlin - 1990
38	Qualitative Analysis of Large Scale Dynamical Systems - Michel, Miller - 1977
38	Ordinary Differential Equations - Miller, Michel - 1982
38	The Efficiency of Greedy Routing in Hypercubes and Butterflies - Stamoulis, Tsitsiklis - 1991
36	On the optimal assignment of customers to parallel servers - Weber - 1978
35	auf der Heide. Simple, efficient shared memory simulations - Dietzfelbinger, Meyer
35	An optical simulation of shared memory - Goldberg, Matias, et al. - 1994
35	Limit theorems for sequences of jump Markov process approximating ordinary differential processes - Kurtz - 1971
33	On contention resolution protocols and associated probabilistic phenomena - MacKenzie, Plaxton, et al. - 1998
30	Pairwise Independence and Derandomization - Luby, Wigderson - 1995
28	Bounding Delays in Packet Routing Networks - Harchol-Balter, Wolfe - 1995
28	Bounds on the Greedy Routing Algorithm for Array Networks - Mitzenmacher - 1996
22	Average Delay in Queues with Non-Stationary Poisson Arrivals - Ross - 1978