A generalization of multiple choice balls-into-bins

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 297-298

  Park, Gahyun ^a  

^a STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

load balance; multiple choice

Indexed keywords

DATA PARTITION; DISTRIBUTED FILE SYSTEMS; FILE REPLICATION; LOAD BALANCE; MAXIMUM LOAD; MULTIPLE CHOICE; TUNABLE PARAMETER;

DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; FAULT TOLERANCE; SPHERES;

BINS;

EID: 79959915728     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993862     Document Type: Conference Paper

References (8)

1. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM Journal on Computing, 29(1):180-200, September 1999. (Pubitemid 30588356)
2. P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking. Balanced allocations: the heavily loaded case. In STOC, pages 745-754, 2000.
3. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: amazon's highly available key-value store. In SIGOPS, pages 205-220, 2007.
4. L. Devroye, G. Lugosi, G. Park, and W. Szpankowski. Multiple choice tries and distributed hash tables. In SODA, pages 891-899, 2007.
5. P. B. Godfrey. Balls and bins with structure: balanced allocations on hypergraphs. In SODA, pages 511-517, 2008.
6. A. Lakshman and P. Malik. Cassandra: a decentralized structured storage system. SIGOPS Oper. Syst. Rev, 44(2):35-40, April 2010.
7. Y. Peres, K. Talwar, and U. Wieder. The (1 + β)-choice process and weighted balls into bins. In SODA, pages 1613-1619, 2010.
8. B. Vöcking. How asymmetry helps load balancing. Journal of ACM, 50(4):568-589, July 2003. (Pubitemid 43906338)