Metraipolis › archive › dc_ba17c7876bcb
Stability of Fork-Join Systems with Redundancy and Heterogeneous Servers — arXiv:2609.09237
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.09237
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T09:51:44.453Z
- SHA-256 of the archived text
259c8fc563cb1230d138c24cb727f620be2421a87805e21d46e65d373bb32449- Stable URL of this page
https://metraipolis.com/documento/dc_ba17c7876bcb
How to cite
Stability of Fork-Join Systems with Redundancy and Heterogeneous Servers — arXiv:2609.09237 — arXiv (en), https://arxiv.org/abs/2609.09237 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ba17c7876bcb (Metraipolis archive dc_ba17c7876bcb, sha256 259c8fc563cb1230d138c24cb727f620be2421a87805e21d46e65d373bb32449)
BibTeX
@misc{dcba17c7876bcb,
title = {Stability of Fork-Join Systems with Redundancy and Heterogeneous Servers — arXiv:2609.09237},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.09237},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ba17c7876bcb; sha256 259c8fc563cb1230d138c24cb727f620be2421a87805e21d46e65d373bb32449},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09237. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider the stability problem of fork-join systems with redundancy (FJR) and heterogeneous servers under both static and dynamic capacity-allocation policies. In an $(n,k)$ FJR system, each arriving job is split into $n$ independent tasks, with one task assigned to each of $n$ parallel servers. Once $k \le n$ tasks have been processed, they are joined and the corresponding job departs the system; the remaining $n-k$ unprocessed tasks are then removed and are therefore termed redundant. We first identify the nominal traffic intensity and characterize the maximal stability region, defined as the set of traffic intensities for which there exists an admissible policy that stabilizes the system. We then establish conditions under which this maximal stability region is attained for two classes of policies: static and dynamic. Specifically, we show that for static allocation policies, in which service capacities remain fixed over time, maximality is achieved whenever the fastest server is allocated no more than $1/k$ of the total service capacity. For dynamic allocation policies, in which a fixed total service capacity may be repeatedly reallocated among the servers, we show that maximality is achieved whenever the cumulative capacity allocated to the $j$ shortest queues does not exceed $j/k$ of the total capacity for every $j=1,\ldots,k-1$. Our analysis is based on a projection of the $(n,k)$ FJR system onto a simpler $(k,k)$ system that has no redundancy, together with a novel sample-path comparison argument for multidimensional processes based on the generalized Schur-convex order. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.PR). Categorie arXiv: Information Theory (cs.IT) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.09237 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T08:44:35.302Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).