Performance of a Server Cluster with Parallel Processing and Randomized Load Balancing

Abstract : We consider a cluster of servers where each incoming job is assigned d servers chosen uniformly at random, for some fixed d ≥ 2. Jobs are served in parallel and the resource allocation is balanced fairness. We provide a recursive formula for computing the exact mean service rate of each job. The complexity is polynomial in the number of servers.
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01306343
Contributor : Thomas Bonald <>
Submitted on : Friday, April 22, 2016 - 7:07:41 PM
Last modification on : Tuesday, May 14, 2019 - 10:14:42 AM
Long-term archiving on : Tuesday, November 15, 2016 - 10:56:12 AM

File

report.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01306343, version 1

Citation

Thomas Bonald, Céline Comte. Performance of a Server Cluster with Parallel Processing and Randomized Load Balancing. [Research Report] Telecom ParisTech. 2016. ⟨hal-01306343⟩

Share

Metrics

Record views

300

Files downloads

127