Balls into bins with related random choices

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2010, Pages 100-105

  Berenbrink, Petra ^a   Brinkmann, André ^b   Friedetzky, Tom ^c   Nagel, Lars ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF PADERBORN   (Germany)

^c DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Balls into bins; Peer to peer

Indexed keywords

BALANCEDNESS; EXTENDED MODEL; HIGH PROBABILITY; MAXIMUM LOAD; P2P NETWORK; PEER TO PEER; RANDOM CHOICE; TIGHT BOUND; UPPER BOUND;

DISTRIBUTED COMPUTER SYSTEMS; PEER TO PEER NETWORKS; PROBABILITY; SPHERES;

BINS;

EID: 77954898316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810479.1810500     Document Type: Conference Paper

References (15)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. In Proceedings of the 26th ACM Symposium on Theory of Computing (STOC), pages 593-602, 1994.
2. M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide. Dynamic load balancing in distributed hash tables. In Proceedings of the 4th International workshop on Peer-To-Peer Systems (IPTPS), pages 217-225, 2005.
3. J. Byers, J. Considine, and M. Mitzenmacher. Simple load balancing for distributed hash tables. In Proceedings of the 2nd International workshop on Peer-To-Peer Systems (IPTPS), pages 80-87, February 2003.
4. J. Byers, J. Considine, and M. Mitzenmacher. Geometric generalizations of the power of two choices. In Proceedings of the 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 54-63, 2004.
5. D. P. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Springer, 2009.
6. B. Godfrey. Balls and bins with structure: Balanced allocations on hypergraphs. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 511-517, 2008.
7. R. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. In Proceedings of the 24th ACM Symposium on Theory of Computing (STOC), pages 318-326, 1992.
8. M. Mitzenmacher, A. Richa, and R. Sitaramani. Handbook of Randomized Computing, Volume 1, chapter: The power of two random choices: A survey of techniques and results, pages 255-312. Springer, 2001.
9. M. Palankar, A. Iamnitchi, M. Ripeanu, and S. Garfinkel. Amazon S3 for Science Grids: a Viable Solution? In Proceedings of the 2008 International Workshop on Data-aware Distributed Computing (DADC), pages 55-64, 2008.
10. M. Raab and A. Steger. Balls into Bins - A Simple and Tight Analysis. In Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pages 159-170, 1998.
11. C. Scheideler. Probabilistic methods for coordination problems. Habilitation thesis, 2000.
12. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11(1):17-32, 2003.
13. U. Čibej, B. Slivnik, and B. Robič. The complexity of static data replication in data grids. Parallel Computing, 31(8+9):900-912, 2005.
14. B. Vöcking. How asymmetry helps load balancing. Journal of the ACM, 50(4):568-589, 2003.
15. U. Wieder. Balanced allocations with heterogenous bins. In Proceedings of the 19th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 188-193, 2007.