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., Canada;Department of Computer Science, University of Durham, Durham, U.K.;School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;Department of Computer Science, University of Warwick, Coventry, U.K.
Venue:
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Year:
2005

Citing 10
Cited 2

Efficient PRAM simulation on a distributed memory machine

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algorithms for random generation and counting: a Markov chain approach

Algorithms for random generation and counting: a Markov chain approach
Randomized algorithms

Randomized algorithms
Parallel balanced allocations

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Balanced Allocations

SIAM Journal on Computing
Balanced allocations: the heavily loaded case

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Randomized allocation processes

Random Structures & Algorithms
Load Balancing with Memory

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Path coupling: A technique for proving rapid mixing in Markov chains

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
How Asymmetry Helps Load Balancing

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Balanced allocations: the weighted case

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

Theoretical Computer Science

Quantified Score

Hi-index	0.01

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.