Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
How asymmetry helps load balancing
Journal of the ACM (JACM)
Geometric generalizations of the power of two choices
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Drafting behind Akamai (travelocity-based detouring)
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Balanced allocations with heterogenous bins
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Balls and bins with structure: balanced allocations on hypergraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Amazon S3 for science grids: a viable solution?
DADC '08 Proceedings of the 2008 international workshop on Data-aware distributed computing
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
The complexity of static data replication in data grids
Parallel Computing
Mitigating unfairness in locality-aware peer-to-peer networks
International Journal of Network Management
Dynamic load balancing in distributed hash tables
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We consider a variation of classical balls-into-bins games. We randomly allocate m balls into n bins. Following Godfrey's model (Godfrey, 2008) [7], we assume that each ball i comes with a @b-balanced set of clusters B"i={B"1,...,B"s"""i}, each containing a logarithmic number of balls. The condition of @b-balancedness essentially enforces a uniform-like selection of bins for the clusters, where the parameter @b=1 governs the deviation from uniformity. Each ball i=1,...,m, in turn, runs the following protocol: (i) it i.u.r. (independently and uniformly at random) chooses a cluster of bins B"i@?B"i, and (ii) it i.u.r. chooses one of the empty bins in B"i and allocates itself to it. Should the cluster not contain at least a single empty bin, then the protocol fails. If the protocol terminates successfully, that is, every ball has indeed been able to find at least one empty bin in its chosen cluster, then this will obviously result in a maximum load of one. The main goal is to find a tight bound on the maximum number of balls, m, so that the protocol terminates successfully with a high probability. In this paper, we improve on Godfrey's result and show that m=n@Q(@b). We use a more relaxed notion of balancedness than (Godfrey, 2008) [7] and show that our upper bounds hold for this type of balancedness. It even holds when we generalise the model and allow runs where each ball i tosses a coin and it copies the previous ball's choice B"i"-"1 with constant probability p"i (0