DeepAI

AI Chat AI Image Generator AI Video AI Music Generator

Comparison of the FCFS and PS discipline in Redundancy Systems

03/24/2021

∙

by Youri Raaijmakers, et al.

∙

∙

We consider the c.o.c. redundancy system with N parallel servers where incoming jobs are immediately replicated to d servers chosen uniformly at random (without replacement). A job finishes service as soon as the first replica is completed, after which all the remaining replicas are abandoned. We compare the performance of the first-come first-served (FCFS) and processor-sharing (PS) discipline based on the stability condition, the tail behavior of the latency and the expected latency.

research

∙ 03/16/2022

A Model of Job Parallelism for Latency Reduction in Large-Scale Systems

Processing computation-intensive jobs at multiple processing cores in pa...

0 Ayalvadi Ganesh, et al. ∙

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...

0 E Anton, et al. ∙

research

∙ 03/17/2021

A Survey of Stability Results for Redundancy Systems

Redundancy mechanisms consist in sending several copies of a same job to...

0 Elene Anton, et al. ∙

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...

0 Gal Mendelson, et al. ∙

research

∙ 06/25/2019

Straggler Mitigation at Scale

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

0 Mehmet Fatih Aktas, et al. ∙

research

∙ 01/27/2022

Queueing Systems with Some Versions of Limited Processor Sharing Discipline

The paper considers a queueing system with limited processor sharing. No...

0 M. S. Alencar, et al. ∙

research

∙ 08/31/2021

Latency-Redundancy Tradeoff in Distributed Read-Write Systems

Data is replicated and stored redundantly over multiple servers for avai...

0 Saraswathy Ramanathan, et al. ∙