Efficient scheduling in redundancy systems with general service times
Elene Anton (UPPA), Rhonda Righter (UC Berkeley), Ina Maria Maaike Verloop (IRIT-RMESS, Toulouse INP, CNRS)

TL;DR
This paper analyzes how different scheduling policies affect mean response time in redundancy systems with general service times, identifying optimal policies under various service time distributions and demonstrating significant improvements over oblivious policies.
Contribution
It characterizes the impact of redundancy-aware scheduling policies on response time, providing theoretical results and simulations for various service time distributions.
Findings
LRF policies outperform others with exponential service times
MRF-FCFS outperforms LRF-FCFS with high variability in New-Worse-than-Used times
Redundancy-aware policies significantly improve response time over oblivious policies
Abstract
We characterize the impact of scheduling policies on the mean response time in nested systems with cancel-on-complete redundancy. We consider not only redundancy-oblivious policies, such as FCFS and ROS, but also redundancy-aware policies of the form 1 -- 2 , where 1 discriminates among job classes (e.g., least-redundant-first (LRF), most-redundantfirst (MRF)) and 2 discriminates among jobs of the same class. Assuming that jobs have independent and identically distributed (i.i.d.) copies, we prove the following: (i) When jobs have exponential service times, LRF policies outperform any other policy. (ii) When service times are New-Worse-than-Used, MRF-FCFS outperforms LRF-FCFS as the variability of the service time grows infinitely large. (iii) When service times are New-Better-than-Used, LRF-ROS (resp. MRF-ROS) outperforms LRF-FCFS (resp. MRF-FCFS) in a…
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.
