On weighted balls-into-bins games

Authors:
Petra Berenbrink;Tom Friedetzky;Zengjian Hu;Russell Martin
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada;Department of Computer Science, University of Durham, Durham, DH1 3LE, UK;School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada;Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK
Venue:
Theoretical Computer Science
Year:
2008

Citing 6
Cited 3

Balanced Allocations

SIAM Journal on Computing
Load Balancing with Memory

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
How asymmetry helps load balancing

Journal of the ACM (JACM)
Balanced Allocations: The Heavily Loaded Case

SIAM Journal on Computing
Balanced allocations: the weighted case

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On weighted balls-into-bins games

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

PLDA+: Parallel latent dirichlet allocation with data placement and pipeline processing

ACM Transactions on Intelligent Systems and Technology (TIST)
Tight bounds for parallel randomized load balancing: extended abstract

Proceedings of the forty-third annual ACM symposium on Theory of computing
Parallel skyline queries

Proceedings of the 15th International Conference on Database Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider the well-known problem of randomly allocating m balls into n bins. We investigate various properties of single-choice games as well as multiple-choice games in the context of weighted balls. We are particularly interested in questions that are concerned with the distribution of ball weights, and the order in which balls are allocated. Do any of these parameters influence the maximum expected load of any bin, and if yes, then how? The problem of weighted balls is of practical relevance. Balls-into-bins games are frequently used to conveniently model load balancing problems. Here, weights can be used to model resource requirements of the jobs, i.e., memory or running time.