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: | English |
| Published: |
Association for Computing Machinery (ACM),
2017-05-12T19:32:41Z.
|
| Subjects: | |
| Online Access: | Get fulltext |
Search Result 1