Abstract
We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate
We study the fundamental resource requirements (memory bits and message exchange rate), in order to drive the expected queueing delay in steady-state of a typical job to zero, as
Citation
David Gamarnik. John N. Tsitsiklis. Martin Zubeldia. "A lower bound on the queueing delay in resource constrained load balancing." Ann. Appl. Probab. 30 (2) 870 - 901, April 2020. https://doi.org/10.1214/19-AAP1519
Information