Zero-wait load balancing with sparse messaging
From MaRDI portal
Publication:2183223
Recommendations
- Open problem: Load balancing using delayed information
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Large-system insensitivity of zero-waiting load balancing algorithms
- A lower bound on the queueing delay in resource constrained load balancing
- Scalable load balancing in networked systems: universality properties and stochastic coupling methods
Cites work
- A simple dynamic routing problem
- Delay, memory, and messaging tradeoffs in distributed service systems
- Large-scale join-idle-queue system with general service times
- Optimality of the shortest line discipline
- Pull-based load distribution in large-scale heterogeneous service systems
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- The power of slightly more than one sample in randomized load balancing
- Universality of load balancing schemes on the diffusion scale
- Universality of power-of-d load balancing in many-server systems
Cited in
(5)- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Large-system insensitivity of zero-waiting load balancing algorithms
- Stability, memory, and messaging trade-offs in heterogeneous service systems
- Join-Up-To\((m)\): improved hyperscalable load balancing
- Invariance principle and McKean-Vlasov limit for randomized load balancing in heavy traffic
This page was built for publication: Zero-wait load balancing with sparse messaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183223)