Long-term balanced allocation via thinning

DOI10.1214/23-aap1978arXiv2110.05009MaRDI QIDQ6126120

Ohad Noy Feldheim, Jiange Li, Ori Gurel-Gurevich

Publication date: 9 April 2024

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.05009

zbMATH Keywords

load balancingtwo-choiceballs-and-binstwo-thinning

Mathematics Subject Classification ID

Combinatorial probability (60C05) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced allocation: memory performance tradeoffs
• Balls into non-uniform bins
• Choice-memory tradeoff in allocations
• Large deviations techniques and applications.
• Fast concurrent access to parallel disks
• The power of thinning in balanced allocation
• Load balancing under \(d\)-thinning
• Graphical balanced allocations and the (1 + β)-choice process
• Balanced allocation on graphs
• Balanced Allocations
• An Introduction to the Theory of Point Processes
• Balanced Allocations: A Simple Proof for the Heavily Loaded Case
• Probability and Computing
• Balanced Allocations: The Heavily Loaded Case
• An Introduction to the Theory of Point Processes

This page was built for publication: Long-term balanced allocation via thinning