O. Beaumont, T. Lambert, L. Marchal, and B. Thomas, Data-Locality Aware Dynamic Schedulers for Independent Tasks with Replicated Inputs, IPDPSW 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, pp.1-8, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01878977

S. Kavulya, J. Tan, R. Gandhi, and P. Narasimhan, An Analysis of Traces from a Production MapReduce Cluster, International Conference on Cluster, Cloud and Grid Computing (CCGrid), pp.94-103, 2010.

M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1979.

D. Borthakur and . Hdfs-architecture-guide, , p.39, 2008.

M. Zaharia, D. Borthakur, J. Sarma, K. Elmeleegy, S. Shenker et al., Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling, European Conference on Computer Systems (EuroSys), pp.265-278, 2010.

Q. Xie and Y. Lu, Degree-Guided Map-Reduce Task Assignment with Data Locality Constraint, International Symposium on Information Theory (ISIT), pp.985-989, 2012.

M. Isard, V. Prabhakaran, J. Currey, U. Wieder, K. Talwar et al., Quincy: Fair Scheduling for Distributed Computing Clusters, Symposium on Operating Systems Principles (SOSP, pp.261-276, 2009.

S. Ibrahim, H. Jin, L. Lu, B. He, G. Antoniu et al., Maestro: Replica-Aware Map Scheduling for MapReduce, International Symposium on Cluster, Cloud and Grid Computing (CCGrid), pp.435-442, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00670813

W. Wang, K. Zhu, L. Ying, J. Tan, and L. Zhang, Map Task Scheduling in MapReduce with Data Locality: Throughput and HeavyTraffic Optimality, pp.1609-1617, 2013.

Z. Guo, G. C. Fox, and M. Zhou, Investigation of Data Locality in MapReduce, International Symposium on Cluster, Cloud and Grid Computing (CCGrid), pp.419-426, 2012.

L. R. Ford and D. R. Fulkerson, Flows in Networks, 2015.

I. Gog, M. Schwarzkopf, A. Gleave, R. N. Watson, and S. Hand, Firmament: Fast, Centralized Cluster Scheduling at Scale, in: Symposium on Operating Systems Design and Implementation (OSDI), USENIX, pp.99-115, 2016.

O. Selvitopi, G. V. Demirci, A. Turk, and C. Aykanat, Locality-aware and load-balanced static task scheduling for mapreduce, Future Generation Computer Systems, vol.90, pp.49-61, 2019.

M. Raab and A. Steger, Randomization and Approximation Techniques in Computer Science (RANDOM), pp.159-170, 1998.

P. Berenbrink, T. Friedetzky, Z. Hu, and R. Martin, On weighted Balls-into-Bins Games, Theoretical Computer Science (TCS), vol.409, issue.3, pp.511-520, 2008.

M. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing, Transactions on Parallel and Distributed Systems (TPDS), vol.12, issue.10, pp.1094-1104, 2001.

A. W. Richa, M. Mitzenmacher, and R. Sitaraman, The Power of Two Random Choices: A Survey of Techniques and Results, Combinatorial Optimization, vol.9, pp.255-304, 2001.

P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking, Balanced Allocations: The Heavily Loaded Case, Symposium on Theory of Computing (STOC), pp.745-754, 2000.

Y. Peres, K. Talwar, and U. Wieder, The (1+ ?)-Choice Process and Weighted Balls-into-Bins, Symposium on Discrete Algorithms (SODA), SIAM, pp.1613-1619, 2010.

A. Giersch, Y. Robert, and F. Vivien, Scheduling tasks sharing files from distributed repositories, Proceedings of the 10th International Euro-Par Conference, pp.246-253, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00807284

K. Kaya, B. Uçar, and C. Aykanat, Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories, J. Parallel Distrib. Comput, vol.67, issue.3, pp.271-285, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00803511

H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, Heuristics for scheduling parameter sweep applications in grid environments, 9th Heterogeneous Computing Workshop, pp.349-363, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00748942

M. Mitzenmacher and E. , Probability and Computing -Randomized Algorithms and Probabilistic Analysis, 2005.

N. J. Harvey, R. E. Ladner, L. Lovász, and T. Tamir, Semi-matchings for bipartite graphs and load balancing, Journal of Algorithms, vol.59, issue.1, pp.53-78, 2006.

W. Horn, Minimizing average flow time with parallel machines, Operations Research, vol.21, issue.3, pp.846-847, 1973.

J. Bruno, E. G. Coffman, and R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM, vol.17, issue.7, pp.382-387, 1974.

D. J. Abraham, Algorithmics of two-sided matching problems, 2003.

J. Fakcharoenphol, B. Laekhanukit, and D. Nanongkai, Faster algorithms for semi-matching problems, ACM Transactions on Algorithms (TALG), vol.10, issue.3, p.14, 2014.

F. Gal?ík, J. Katreni?, and G. Semani?in, On computing an optimal semi-matching, International Workshop on Graph-Theoretic Concepts in Computer Science, pp.250-261, 2011.

P. Sanders, S. Egner, and J. Korst, Fast Concurrent Access to Parallel Disks, Algorithmica, vol.35, issue.1, pp.21-55, 2003.

A. Czumaj, C. Riley, and C. Scheideler, Perfectly Balanced Allocation, Approximation, Randomization, and Combinatorial Optimization (APPROX, pp.240-251, 2003.

T. Lambert, On the Effect of Replication of Input Files on the Efficiency and the Robustness of a Set of Computations, 2017.
URL : https://hal.archives-ouvertes.fr/tel-01661588