Optimal Ball Recycling

@inproceedings{Bender2019OptimalBR,
  title={Optimal Ball Recycling},
  author={M. A. Bender and Jake Christensen and Alex Conway and Martin Farach-Colton and R. Johnson and M. Tsai},
  booktitle={SODA},
  year={2019}
}
Balls-and-bins games have been a wildly successful tool for modeling load balancing problems. In this paper, we study a new scenario, which we call the ball recycling game, defined as follows: Throw m balls into n bins i.i.d. according to a given probability distribution p. Then, at each time step, pick a non-empty bin and recycle its balls: take the balls from the selected bin and re-throw them according to p. This balls-and-bins game closely models memory-access heuristics in databases. The… Expand
4 Citations
Achieving optimal backlog in multi-processor cup games
  • 7
  • PDF
Copy-on-Abundant-Write for Nimble File System Clones
  • PDF
Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design
  • 6
  • PDF
The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
  • PDF

References

SHOWING 1-10 OF 44 REFERENCES
Balanced Allocations
  • 749
How asymmetry helps load balancing
  • B. Vocking
  • 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
  • 96
Randomized allocation processes
  • A. Czumaj, V. Stemann
  • Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
  • 53
On Balls and Bins with Deletions
  • 53
  • PDF
A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds
  • Gahyun Park
  • Mathematics, Computer Science
  • Algorithmica
  • 2016
  • 3
...
1
2
3
4
5
...