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.

翻译：我们考虑的是C.o.c.冗余系统,有美元平行服务器,输入的工作可立即复制到统一随机选择的美元服务器上(不替换),第一份复制完成后,所有剩余复制品就被废弃。我们根据稳定性状况、延缓的尾部行为和预期的延缓度,对先到先获得(FCFS)和处理共享(PS)纪律的性能进行比较。