English

Large-scale parallel server system with multi-component jobs

Probability 2020-12-21 v2 Distributed, Parallel, and Cluster Computing

Abstract

A broad class of parallel server systems is considered, for which we prove the steady-state asymptotic independence of server workloads, as the number of servers goes to infinity, while the system load remains sub-critical. Arriving jobs consist of multiple components. There are multiple job classes, and each class may be of one of two types, which determines the rule according to which the job components add workloads to the servers. The model is broad enough to include as special cases some popular queueing models with redundancy, such as cancel-on-start and cancel-on-completion redundancy. Our analysis uses mean-field process representation and the corresponding mean-field limits. In essence, our approach relies almost exclusively on three fundamental properties of the model: (a) monotonicity, (b) work conservation, (c) the property that, on average, "new arriving workload prefers to go to servers with lower workloads."

Keywords

Cite

@article{arxiv.2006.11256,
  title  = {Large-scale parallel server system with multi-component jobs},
  author = {Seva Shneer and Alexander Stolyar},
  journal= {arXiv preprint arXiv:2006.11256},
  year   = {2020}
}

Comments

21 pages, 1 figure. Revision

R2 v1 2026-06-23T16:28:16.358Z