Michael Mitzenmacher, Andréa W. Richa, Ramesh Sitaraman  Home/Search
Context Related
| harvard.edu/~michaelm...twosurvey.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: harvard.edu/~michaelm/NE...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction 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 independently and uniformly at random. Then the maximum load, or the largest number of balls in any bin, is approximately log n/ log log n with high probability. Now suppose instead that the balls are placed sequentially, and each ball is placed in the least loaded of d >= 2 bins chosen independently and... (Update)
Cited by: More
Perfectly Balanced Allocation - Czumaj, Riley, Scheideler (2003) (Correct)
Multi-scale and Adaptive CS-RBFs for Shape Reconstruction .. - Ohtake, Belyaev, Seidel (2003) (Correct)
3D Scattered Data Approximation with Adaptive Compactly.. - Ohtake, Belyaev, Seidel (Correct)
Similar documents (at the sentence level):
66.5%: The Power of Two Random Choices: A Survey of Techniques .. - Mitzenmacher, Richa.. (2000) (Correct)
5.9%: On Balls and Bins with Deletions - Cole, Frieze, Maggs, Mitzenmacher.. (1998) (Correct)
Active bibliography (related documents): More All
0.9: The Natural Work-Stealing Algorithm is Stable - Berenbrink, Friedetzky, Goldberg (2001) (Correct)
0.9: Symmetric vs. Asymmetric Multiple-Choice Algorithms - Vöcking (Correct)
0.9: The Power of Two Choices in Randomized Load Balancing - Mitzenmacher (1996) (Correct)
Similar documents based on text: More All
0.4: Balls and Bins Models with Feedback - Drinea, Frieze, Mitzenmacher (2002) (Correct)
0.4: A Scaling Result for Explosive Processes - Mitzenmacher, Spencer (Correct)
0.2: The "Four Stimulus-Two Choice"-Paradigm In Multidimensional.. - Hauf, Sarris (Correct)
Related documents from co-citation: More All
8: Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
7: Viceroy: A scalable and dynamic emulation of the butterfly - MALKHI, NAOR et al. - 2002
7: Consistent hashing and random trees: Distributed caching protocols for relieving.. - Karger, Lehman et al. - 1997
BibTeX entry: (Update)
Mitzenmacher, M., Richa, A., and Sitaraman, R. The power of two random choices: A survey of the techniques and results. In Handbook of Randomized Computing, P. Pardalos, S. Rajasekaran, and J. Rolim, Eds. Kluwer, 2000. http://citeseer.ist.psu.edu/article/mitzenmacher00power.html More
@misc{ mitzenmacher00power,
author = "M. Mitzenmacher and A. Richa and R. Sitaraman",
title = "The power of two random choices: A survey of the techniques and results",
text = "Mitzenmacher, M., Richa, A., and Sitaraman, R. The power of two random
choices: A survey of the techniques and results. In Handbook of Randomized
Computing, P. Pardalos, S. Rajasekaran, and J. Rolim, Eds. Kluwer, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/article/mitzenmacher00power.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
957 The Probabilistic Method (context) - Alon, Spencer - 1992
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
266 Adaptive load sharing in homogeneous distributed systems (context) - Eager, Lazowska et al. - 1986
192 Markov Processes: Characterization and convergence (context) - Ethier, Kurtz - 1986
157 Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
148 Storing a sparse table with o (context) - Fredman, Koml'os et al. - 1984
145 Universal schemes for parallel communication (context) - Valiant, Brebner - 1981
134 A scheme for fast parallel communication (context) - Valiant - 1982
126 Comparison Methods for Queues and Other Stochastic Models (context) - Stoyan - 1983
124 Lectures on the Coupling Method (context) - Lindvall - 1992
109 Practical loss-resilient codes - Luby, Mitzenmacher et al. - 1997
102 Dynamic perfect hashing --- upper and lower bounds - Dietzfelbinger, Karlin et al. - 1988
99 Information Processing Letters (context) - Hagerup, Rub et al. - 1990
90 Randomized routing and sorting on fixedconnection networks - Leighton, Maggs et al. - 1994
86 Large Deviations for Performance Analysis (context) - Shwartz, Weiss - 1995
81 Efficient PRAM simulation on a distributed memory machine - Karp, Luby et al. - 1992
81 Efficient PRAM simulation on a distributed memory machine - Karp, Luby et al. - 1996
66 The power of two choices in randomized load balancing - Mitzenmacher - 1996
58 An optimal algorithm for on-line bipartite matching (context) - Karp, Vazirani et al. - 1990
58 How useful is old information - Mitzenmacher - 2000
57 Efficient schemes for parallel communication (context) - Upfal - 1984
57 Tail bounds for occupancy and the satisfiability threshold c.. - Kamath, Motwani et al. - 1995
52 A simple load balancing scheme for task allocation in parall.. - Rudolph, Slivkin-Allalouf et al. - 1991
49 Path coupling: a technique for proving rapid mixing in Marko.. (context) - Bubley, Dyer - 1997
47 Urn Models and Their Application (context) - Johnson, Kotz - 1977
47 Stochastic Orders and Their Applications (context) - Shaked, Shantikumar - 1994
46 Approximation of Population Processes (context) - Kurtz - 1981
45 Thread scheduling for multiprogrammed multiprocessors - Arora, Blumofe et al. - 1998
42 Randomized parallel algorithms for backtrack search and bran.. (context) - Karp, Zhang - 1993
41 Optimality of the shortest line discipline (context) - Winston - 1977
41 Load balancing and density dependent jump Markov processes (context) - Mitzenmacher - 1996
41 Expected length of the longest probe sequence in hash code s.. (context) - Gonnet - 1981
40 Parallel randomized load balancing - Adler, Chakrabarti et al. - 1995
40 On contention resolution protocols and associated probabilis.. - Mackenzie, Plaxton et al. - 1998
38 An optical simulation of shared memory - Goldberg, Matias et al. - 1994
37 ACM Transactions on Programming Languages and Systems (context) - Finkel, Manber et al. - 1987
35 Maximum matchings in sparse random graphs (context) - Karp, Sipser - 1981
35 the analysis of randomized load balancing schemes - Mitzenmacher - 1999
27 the optimal assignment of customers to parallel servers (context) - Weber - 1978
27 Randomized allocation processes (context) - Czumaj, Stemann - 1997
27 Analysis of the effects of delays on load sharing (context) - Mirchandaney, Towsley et al. - 1989
26 Finding the right ATM switch for the market (context) - Rooholamini, Cherkassky et al. - 1994
24 Multi-level adaptive hashing (context) - Broder, Karlin - 1990
24 Randomized parallel communication (context) - Aleliunas - 1982
23 Parallel balanced allocations - Stemann - 1996
22 Queueing system with selection of the shortest of two queues.. (context) - Vvedenskaya, Dobrushin et al. - 1996
21 Architectural choices in large scale ATM switches - Turner, Yamanaka - 1997
21 Balanced allocations: The heavily loaded case - Berenbrink, Czumaj et al. - 2000
20 Shared memory simulations with triple-logarithmic delay - Czumaj, auf et al. - 1995
20 Deciding which queue to join: Some counterexamples (context) - Whitt - 1986
19 Differential equations for random processes and random graph.. (context) - Wormald - 1995
18 Solutions of ordinary differential equations as limits of pu.. (context) - Kurtz - 1970
18 On balls and bins with deletions - Cole, Frieze et al. - 1998
18 The analysis of a list-coloring algorithm on a random graph (context) - Achlioptas, Molloy - 1997
16 Simple algorithms for routing on butterfly networks with bou.. - Maggs, Sitaraman - 1992
15 Interpreting stale load information - Dahlin - 1999
15 Using multiple hash functions to improve ip lookups - Broder, Mitzenmacher - 2000
14 Mathematical foundations of the markov chain monte carlo met.. - Jerrum - 1998
12 Randomized protocols for low-congestion circuit routing in m.. - Cole, Maggs et al. - 1998
12 Analysis of simple algorithms for dynamic load balancing - Alanyali, Hajek - 1990
11 How asymmetry helps load balancing - Vocking - 1999
11 Exploiting storage redundancy to speed up randomized shared .. - auf, Scheideler et al. - 1996
11 Recovery time of dynamic allocation processes - Czumaj - 1998
10 Asymptotic analysis of an assignment problem arising in a di.. (context) - Hajek - 1988
10 Analyzing an infinite parallel job allocation process - Adler, Berenbrink et al. - 1998
10 A fully distributed chess program - Feldmann, Mysliwietz et al. - 1991
10 Maximum matchings in sparse random graphs: Karp-Sipser revis.. - Aronson, Frieze et al. - 1998
9 Extensible cluster-based scalable network services - Fox, Gribble et al. - 1997
9 Analysis of the symmetric shortest queue problem (context) - Adan, Wessels et al. - 1990
9 Studying balanced allocations with differential Combinatoric.. - Mitzenmacher - 1999
8 Allocating weighted jobs in parallel - Berenbrink, auf et al. - 1997
5 Stochastic bounds for fast Jackson networks - Martin
5 A compensation approach for queueing problems (context) - Adan - 1994
5 Point processes in fast Jackson networks - Martin
5 Dobrushin's mean-field approximation for a queue with dynami.. (context) - Vvedenskaya, Suhov - 1997
5 Parallel continuous randomized load balancing - Berenbrink, Friedetzky et al. - 1998
4 Constrained randomization for parallel communication (context) - Ranade - 1987
4 The Art of Computer Programming I--III (context) - Knuth - 1973
4 A limit result respecting graph structure for a fully connec.. (context) - Crametz, Hunt - 1991
4 The asymptotics of selecting the shortest of two (context) - Mitzenmacher, Vocking - 1998
3 Randomized and adversarial load balancing (context) - Berenbrink, Friedetzky et al. - 1999
2 Annals of Applied Probability (context) - Martin, Suhov et al. - 1999
2 A comparison of receiver-intiated adaptive load sharing (context) - Eager, Lazowska et al. - 1986
1 Analyses of load stealing models using differential equation.. (context) - Mitzenmacher - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.eecs.harvard.edu/~michaelm/NEWWORK/papers.html): More
Improved Classification via Connectivity Information - Broder, Krauthgamer.. (Correct)
Accessing Multiple Mirror Sites in Parallel: Using.. - Byers, Luby.. (1999) (Correct)
Improved Results for Route Planning in Stochastic.. - Boyan, Mitzenmacher (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC