Power-of-d-Choices with Memory: Fluid Limit and Optimality

DOI10.1287/moor.2019.1014zbMath1451.90044arXiv1802.06566OpenAlexW2997599485MaRDI QIDQ3387905

Jonatha Anselmi, François Dufour

Publication date: 8 January 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic optimalityfluid limitrandomized load balancing

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Stochastic coordination in heterogeneous load balancing systems ⋮ Join-Up-To\((m)\): improved hyperscalable load balancing ⋮ Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems

Cites Work

• Unnamed Item
• Asymptotic independence of queues under randomized load balancing
• State space collapse with application to heavy traffic limits for multiclass queueing networks
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Averaging over fast variables in the fluid limit for Markov chains: Application to the supermarket model with memory
• Pull-based load distribution in large-scale heterogeneous service systems
• Randomized longest-queue-first scheduling for large-scale buffered systems
• Asymptotic Optimality of Balanced Routing
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• Balanced Allocations
• The Power of Slightly More than One Sample in Randomized Load Balancing
• Redundancy-d: The Power of d Choices for Redundancy

This page was built for publication: Power-of-d-Choices with Memory: Fluid Limit and Optimality