Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems
We consider the following distributed service model: jobs with unit mean, exponentially distributed, and independent processing times arrive as a Poisson process of rate λ N, with 0<λ<1, and are immediately dispatched to one of several queues associated with N identical servers with unit proce...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computing Machinery (ACM)
2017
|
| Online Access: | http://hdl.handle.net/1721.1/109061 https://orcid.org/0000-0001-8898-8778 https://orcid.org/0000-0003-2658-8239 https://orcid.org/0000-0003-1320-9893 |