Comparison of the FCFS and PS discipline in Redundancy Systems
Performance
2021-04-16 v1 Probability
Abstract
We consider the c.o.c. redundancy system with parallel servers where incoming jobs are immediately replicated to 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.
Keywords
Cite
@article{arxiv.2104.07458,
title = {Comparison of the FCFS and PS discipline in Redundancy Systems},
author = {Youri Raaijmakers},
journal= {arXiv preprint arXiv:2104.07458},
year = {2021}
}