Balanced allocations: the heavily loaded case
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Infinite parallel job allocation (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the drift of short schedules
Theoretical Computer Science
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Weak Communication in Radio Networks
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Dispersion games: general definitions and some specific learning results
Eighteenth national conference on Artificial intelligence
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cuckoo hashing: further analysis
Information Processing Letters
How asymmetry helps load balancing
Journal of the ACM (JACM)
Presenting data from experiments in algorithmics
Experimental algorithmics
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Optimizing result prefetching in web search engines with segmented indices
ACM Transactions on Internet Technology (TOIT)
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
On zone-balancing of peer-to-peer networks: analysis of random node join
Proceedings of the joint international conference on Measurement and modeling of computer systems
Journal of Algorithms
Geometric generalizations of the power of two choices
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
IEEE/ACM Transactions on Networking (TON)
The CNN problem and other k-server variants
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
Multidimensional balanced allocations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Steady state analysis of balanced-allocation routing
Random Structures & Algorithms
A scheme for load balancing in heterogenous distributed hash tables
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Randomization does not reduce the average delay in parallel packet switches
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Irrigating ad hoc networks in constant time
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
Asymmetric balanced allocation with simple hash functions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
Deterministic load balancing and dictionaries in the parallel disk model
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Adaptive routing in high-radix clos network
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Balanced allocation and dictionaries with tightly packed constant size bins
Theoretical Computer Science
Balanced allocations with heterogenous bins
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Balanced allocations: the weighted case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An improved construction for counting bloom filters
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The k-orientability thresholds for Gn, p
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Optimizing result prefetching in web search engines with segmented indices
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
C2: a new overlay network based on CAN and Chord
International Journal of High Performance Computing and Networking
Simple summaries for hashing with choices
IEEE/ACM Transactions on Networking (TON)
Anonymity and k-Choice Identities
Information Security and Cryptology
Confidently Cutting a Cake into Approximately Fair Pieces
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
The Power of Choice in a Generalized Pólya Urn Model
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On weighted balls-into-bins games
Theoretical Computer Science
A new analytical method for parallel, diffusion-type load balancing
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Kinesis: A new approach to replica placement in distributed storage systems
ACM Transactions on Storage (TOS)
A self-adaptable query allocation framework for distributed information systems
The VLDB Journal — The International Journal on Very Large Data Bases
MANETS: High Mobility Can Make Up for Low Transmission Power
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
An Analysis of Random-Walk Cuckoo Hashing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Real-time parallel hashing on the GPU
ACM SIGGRAPH Asia 2009 papers
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Quantum sampling for balanced allocations
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
TOLB: a traffic-oblivious load-balancing protocol for next-generation sensornets
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Knbest - a balanced request allocation method for distributed information systems
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Load balancing and orientability thresholds for random hypergraphs
Proceedings of the forty-second ACM symposium on Theory of computing
On cost-aware monitoring for self-adaptive load sharing
IEEE Journal on Selected Areas in Communications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Redesigning multi-channel P2P live video systems with View-Upload Decoupling
Computer Networks: The International Journal of Computer and Telecommunications Networking
The (1 + β)-choice process and weighted balls-into-bins
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Tight thresholds for cuckoo hashing via XORSAT
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Progressive hashing for packet processing using set associative memory
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Delaying satisfiability for random 2SAT
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Randomized load balancing strategies with churn resilience in peer-to-peer networks
Journal of Network and Computer Applications
Advanced hashing schemes for packet forwarding using set associative memory architectures
Journal of Parallel and Distributed Computing
A new analytical method for parallel, diffusion-type load balancing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The power of one move: hashing schemes for hardware
IEEE/ACM Transactions on Networking (TON)
Parallel randomized load balancing: A lower bound for a more general model
Theoretical Computer Science
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
SkimpyStash: RAM space skimpy key-value store on flash-based storage
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Tight bounds for parallel randomized load balancing: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
A generalization of multiple choice balls-into-bins
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Coalition resistant anonymous broadcast encryption scheme based on PUF
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
Faster coupon collecting via replication with applications in gossiping
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
An Analysis of Random-Walk Cuckoo Hashing
SIAM Journal on Computing
Balanced allocation and dictionaries with tightly packed constant size bins
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On weighted balls-into-bins games
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximated two choices in randomized load balancing
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Satisfaction-Based query load balancing
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Efficient set operations in the presence of malicious adversaries
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Anonymous distribution of encryption keys in cellular broadcast systems
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Fractional matching via balls-and-bins
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Honest-verifier private disjointness testing without random oracles
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Revisiting randomized parallel load balancing algorithms
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Online stochastic weighted matching: improved approximation algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Journal of Discrete Algorithms
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
Revisiting randomized parallel load balancing algorithms
Theoretical Computer Science
Information spreading in dynamic graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Asymptotic Optimality of Balanced Routing
Operations Research
Converting online algorithms to local computation algorithms
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Sharp load thresholds for cuckoo hashing
Random Structures & Algorithms
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
Random Structures & Algorithms
Cost aware adaptive load sharing
IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems
Theoretical Computer Science
A mean field model for a class of garbage collection algorithms in flash-based solid state drives
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Balls-into-bins with nearly optimal load distribution
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
The loss of serving in the dark
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Opportunistic MANETs: mobility can make up for low transmission power
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
Suppose that we sequentially place $n$ balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability (1 + o(1))ln n/ln ln n balls in it. Suppose instead that for each ball we choose two boxes at random and place the ball into the one which is less full at the time of placement. We show that with high probability, the fullest box contains only ln ln n/ln 2 + O(1) balls---exponentially less than before. Furthermore, we show that a similar gap exists in the infinite process, where at each step one ball, chosen uniformly at random, is deleted, and one ball is added in the manner above. We discuss consequences of this and related theorems for dynamic resource allocation, hashing, and on-line load balancing.