Multidimensional balanced allocations

Authors:
Andrei Broder;Michael Mitzenmacher
Affiliations:
IBM T. J. Watson Research Center, Hawthorne, NY;Harvard University, Cambridge, MA
Venue:
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2005

Citing 3
Cited 0

Balanced Allocations

SIAM Journal on Computing
Optimal plans for aggregation

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Efficient query evaluation using a two-level retrieval process

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a multidimensional variant of the balls-and-bins problem, where balls correspond to random D-dimensional 0-1 vectors. This variant is motivated by a problem in load balancing documents for distributed search engines. We demonstrate the utility of the power of two choices in this domain.