2021/03/24 by Raaijmakers, Youri
#FOS: Computer and information sciences #FOS: Mathematics #Performance (cs.PF) #Probability (math.PR)
paper · doi:10.48550/arxiv.2104.07458
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.