Stability of Redundancy Systems with Processor Sharing
Youri Raaijmakers, Sem Borst, Onno Boxma

TL;DR
This paper analyzes the stability conditions of redundancy systems with processor sharing, revealing how replica size distributions and server heterogeneity influence system stability thresholds.
Contribution
It provides a comprehensive stability criterion for redundancy-d systems with general and dependent replica sizes under processor sharing.
Findings
Stability depends on the expected minimum replica size and interarrival times.
Identical replicas' stability is distribution-insensitive and inversely proportional to the number of replicas.
For i.i.d. replicas, stability thresholds vary with NBU and NWU distributions.
Abstract
We investigate the stability condition for redundancy-d systems where each of the servers follows a processor-sharing (PS) discipline. We allow for generally distributed job sizes, with possible dependence among the d replica sizes being governed by an arbitrary joint distribution. We establish that the stability condition is characterized by the expectation of the minimum of d replica sizes being less than the mean interarrival time per server. In the special case of identical replicas, the stability condition is insensitive to the job size distribution given its mean, and the stability condition is inversely proportional to the number of replicas. In the special case of i.i.d. replicas, the stability threshold decreases (increases) in the number of replicas for job size distributions that are NBU (NWU). We also discuss extensions to scenarios with heterogeneous servers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
