Balls and bins with structure: Balanced allocations on hypergraphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 511-517

  Godfrey, P Brighten ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT LOAD (CL); HASH TABLES; LOAD BALANCING; MAXIMUM LOADS; SERVER SELECTION;

GRAPH THEORY; PROBABILITY DISTRIBUTIONS; SET THEORY; SPHERES;

BINS;

EID: 58449134020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. In Proc. STOC, 1994.
2. John Byers, Jeffrey Considine, and Michael Mitzenmacher. Geometric generalizations of the power of two choices. In Proc. SPAA, 2004.
3. Gaston Gonnet. Expected length of the longest probe sequence in hash code searching. In Journal of the ACM, volume 28, April 1981.
4. Edward F. Grove, Ming-Yang Kao, P. Krishnan, and Jeffrey Scott Vitter. Online perfect matching and mobile computing. In Proceedings of the Fourth Workshop on Algorithms and Data Structures (WADS), 1995.
5. Krishnaram Kenthapadi and Rina Panigrahy. Balanced allocation on graphs. In Proc. SODA, 2006.
6. Donald E. Knuth. Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition). Addison-Wesley Professional, April 1998.
7. Henry Lin, Constantinos Daskalakis, Robert Kleinberg, and Kamalika Chaudhuri. Personal communication, 2007.
8. Michael Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, University of California - Berkeley, 1996.
9. Michael Mitzenmacher and Eli Upfal. Probability and Computing. Cambridge University Press, 2005.
10. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
11. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. SIGCOMM, 2001.
12. Berthold Vöcking. How asymmetry helps load balancing. In IEEE Symposium on Foundations of Computer Science, pages 131-141, 1999.
13. Udi Wieder. Balanced allocations with heterogenous bins. In Proc. SPAA, 2007.