Parallel server systems with cancel-on-completion redundancy
Alexander Stolyar

TL;DR
This paper analyzes a complex parallel server system with cancel-on-completion redundancy, establishing stability, workload tightness, and conditions for asymptotic independence of server workloads in large systems.
Contribution
It provides the first analysis of stability and workload distribution properties for systems with cancel-on-completion redundancy, including conditions for steady-state independence.
Findings
System stability and workload tightness are established.
Conditions for steady-state asymptotic independence are derived.
SSAI-FRL holds when job components are i.i.d. with increasing-hazard-rate distribution.
Abstract
We consider a parallel server system with so-called cancel-on-completion redundancy. There are servers and multiple job classes . An arriving class job consists of components, placed on a randomly selected subset of servers; the job service is complete as soon as components out of (with ) complete their service, at which point the unfinished service of all remaining components is canceled. The system is in general non-work-conserving, in the sense that the average amount of new workload added to the system by an arriving class job is not defined a priori -- it depends on the system state at the time of arrival. This poses the main challenge for the system analysis. For the system with a fixed number of servers our main results include: the stability properties; the property that the stationary distributions of the relative…
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.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Real-Time Systems Scheduling · Distributed systems and fault tolerance
