A Survey of Stability Results for Redundancy Systems

03/17/2021
by   Elene Anton, et al.
0

Redundancy mechanisms consist in sending several copies of a same job to a subset of servers. It constitutes one of the most promising ways to exploit diversity in multiservers applications. However, its pros and cons are still not sufficiently understood in the context of realistic models with generic statistical properties of service-times distributions and correlation structures of copies. We aim at giving a survey of recent results concerning the stability-arguably the first benchmark of performance-of systems with cancel-oncompletion redundancy. We also point out open questions and conjectures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2020

Improving the performance of heterogeneous data centers through redundancy

We analyze the performance of redundancy in a multi-type job and multi-t...
research
03/24/2021

Comparison of the FCFS and PS discipline in Redundancy Systems

We consider the c.o.c. redundancy system with N parallel servers where i...
research
06/21/2022

Efficient scheduling in redundancy systems with general service times

We characterize the impact of scheduling policies on the mean response t...
research
04/30/2020

A Lower Bound on the stability region of Redundancy-d with FIFO service discipline

Redundancy-d (R(d)) is a load balancing method used to route incoming jo...
research
06/09/2019

Partial Server Pooling in Redundancy Systems

Partial sharing allows providers to possibly pool a fraction of their re...
research
02/14/2018

Advancing System Performance with Redundancy: From Biological to Artificial Designs

Redundancy is a fundamental characteristic of many biological processes ...
research
06/25/2019

Straggler Mitigation at Scale

Runtime performance variability at the servers has been a major issue, h...

Please sign up or login with your details

Forgot password? Click here to reset