Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Efficient scheduling in redundancy systems with general service times

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 two-server system. Statement (iii) also holds when job sizes follow a general distribution and have identical copies (all the copies of a job have the same size). Moreover, we show via simulation that, for a large class of redundancy systems, redundancy-aware policies can considerably improve the mean response time compared to redundancy-oblivious policies. We also explore the effect of redundancy on the stability region.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Elene Anton Connect in order to contact the contributor
Submitted on : Wednesday, June 15, 2022 - 11:54:40 AM
Last modification on : Tuesday, November 29, 2022 - 12:12:15 PM


Files produced by the author(s)


  • HAL Id : hal-03695349, version 1


Elene Anton, Rhonda Righter, Ina Maria Maaike Verloop. Efficient scheduling in redundancy systems with general service times. {date}. ⟨hal-03695349⟩



Record views


Files downloads