A lower bound on the queueing delay in resource constrained load balancing
© 2020 Institute of Mathematical Statistics. All rights reserved. We consider the following distributed service model: Jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate λn, with 0 < λ < 1, and are immediately dispatched to one of se...
Main Authors: | Gamarnik, David, Tsitsiklis, John N, Zubeldia, Martin |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | English |
Published: |
Institute of Mathematical Statistics
2021
|
Online Access: | https://hdl.handle.net/1721.1/133724 |
Similar Items
-
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
by: Gamarnik, David, et al.
Published: (2019) -
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
by: Gamarnik, David, et al.
Published: (2017) -
Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems
by: Gamarnik, David, et al.
Published: (2022) -
Delay, stability, and resource tradeoffs in large distributed service systems
by: Zubeldía Suárez, Martín.
Published: (2020) -
A lower bound for distributed averaging algorithms on the line graph
by: Tsitsiklis, John N., et al.
Published: (2012)