J. Visschers, I. Adan, and G. Weiss, A product form solution to a system with multi-type jobs and multi-type servers, Queueing Systems, vol.7, issue.3, pp.269-298, 2012.
DOI : 10.1016/0167-6377(88)90035-1
URL : https://link.springer.com/content/pdf/10.1007%2Fs11134-011-9274-6.pdf

S. Ganesh-ananthanarayanan, . Kandula, G. Albert, I. Greenberg, Y. Stoica et al., Reining in the outliers in map-reduce clusters using mantri, OSDI, p.24, 2010.

A. Vulimiri, P. B. Godfrey, R. Mittal, J. Sherry, S. Ratnasamy et al., Low latency via redundancy, Proceedings of the ninth ACM conference on Emerging networking experiments and technologies, CoNEXT '13, pp.283-294, 2013.
DOI : 10.1145/2535372.2535392
URL : http://arxiv.org/pdf/1306.3707

G. Joshi, E. Soljanin, and G. Wornell, Queues with Redundancy, ACM SIGMETRICS Performance Evaluation Review, vol.43, issue.2, pp.54-56, 2015.
DOI : 10.1109/Allerton.2013.6736597
URL : http://dspace.mit.edu/bitstream/1721.1/113424/1/Wornell_Queues%20with.pdf

B. Nihar, K. Shah, K. Lee, and . Ramchandran, When do redundant requests reduce latency?, IEEE Transactions on Communications, vol.64, issue.2, pp.715-722, 2016.

K. Gardner, S. Zbarsky, S. Doroudi, M. Harchol-balter, E. Hyytiä et al., Queueing with redundant requests: exact analysis, Queueing Systems, vol.70, issue.6, pp.3-4, 2016.
DOI : 10.1145/2523616.2523620

K. Gardner, M. Harchol-balter, A. Scheller-wolf, M. Velednitsky, and S. Zbarsky, Redundancy-d: The Power of d Choices for Redundancy, Operations Research, vol.65, issue.4, 2017.
DOI : 10.1287/opre.2016.1582

A. Ganesh-ananthanarayanan, S. Ghodsi, I. Shenker, and . Stoica, Effective straggler mitigation: Attack of the clones, NSDI, pp.185-198, 2013.

J. Dean and L. Barroso, The tail at scale, Communications of the ACM, vol.56, issue.2, pp.74-80, 2013.
DOI : 10.1145/2408776.2408794

K. Lee, B. Nihar, L. Shah, K. Huang, and . Ramchandran, The MDS Queue: Analysing the Latency Performance of Erasure Codes, IEEE Transactions on Information Theory, vol.63, issue.5, pp.2822-2842, 2017.
DOI : 10.1109/TIT.2017.2674671

K. Lee, R. Pedarsani, and K. Ramchandran, On Scheduling Redundant Requests With Cancellation Overheads, IEEE/ACM Transactions on Networking, vol.25, issue.2, pp.1279-1290, 2017.
DOI : 10.1109/TNET.2016.2622248

K. Gardner, M. Harchol-balter, A. Scheller-wolf, and B. Van-houdt, A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size, IEEE/ACM Transactions on Networking, vol.25, issue.6, pp.3353-3367, 2017.
DOI : 10.1109/TNET.2017.2744607

T. Bonald and C. Comte, Balanced fair resource sharing in computer clusters, Performance Evaluation, vol.116, pp.70-83, 2017.
DOI : 10.1016/j.peva.2017.08.006
URL : https://hal.archives-ouvertes.fr/hal-01581786

T. Bonald, C. Comte, and F. Mathieu, Performance of Balanced Fairness in Resource Pools, Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol.1, issue.2, p.41, 2017.
DOI : 10.1145/964723.383071
URL : https://hal.archives-ouvertes.fr/hal-01630420

A. Krzesinski, Order independent queues Queueing Networks, pp.85-120, 2011.
DOI : 10.1007/978-1-4419-6472-4_2

I. Adan, R. Righter, and G. Weiss, FCFS parallel service systems and matching models, Valuetools, 2017.

G. Joshi, E. Soljanin, and G. Wornell, Efficient Redundancy Techniques for Latency Reduction in Cloud Systems, ACM Transactions on Modeling and Performance Evaluation of Computing Systems, vol.2, issue.2, p.12, 2017.
DOI : 10.1145/2667522.2667524
URL : http://arxiv.org/pdf/1508.03599

M. Harchol-balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action
DOI : 10.1017/CBO9781139226424

T. Hellemans and B. Van-houdt, On the powerof-d-choices with least loaded server selection, To appear in ACM Sigmetrics 2018. Also available as arXiv preprint, 2018.

M. Bramson, Y. Lu, and B. Prabhakar, Asymptotic independence of queues under randomized load balancing, Queueing Systems, vol.32, issue.1, pp.247-292, 2012.
DOI : 10.1007/978-3-642-51866-9
URL : http://www.stanford.edu/~balaji/papers/questa11.pdf

S. Halfin and W. Whitt, Heavy-Traffic Limits for Queues with Many Exponential Servers, Operations Research, vol.29, issue.3, pp.567-588, 1981.
DOI : 10.1287/opre.29.3.567