G. Aupy, M. Shantharam, A. Benoit, Y. Robert, and P. Raghavan, Co-scheduling algorithms for high-throughput workload execution, Journal of Scheduling, vol.23, issue.2, pp.627-640, 2016.
DOI : 10.1142/S012962641340001X
URL : https://hal.archives-ouvertes.fr/hal-00819036

H. Barwick, SKA telescope to generate more data than entire Internet in 2020, 2011.

O. Beaumont and A. Guermouche, Task Scheduling for Parallel Multifrontal Methods, Euro-Par, pp.758-766, 2007.
DOI : 10.1007/978-3-540-74466-5_80
URL : https://hal.archives-ouvertes.fr/hal-00358626

K. P. Belkhale and P. Banerjee, An approximate algorithm for the partitionable independent task scheduling problem, ICPP, pp.72-75, 1990.

E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan, Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms, SIAM Journal on Computing, vol.9, issue.4, pp.808-826, 1980.
DOI : 10.1137/0209062

N. Denoyelle, Instanciate the Cache Aware Roofline Model on single socket and multisocket systems. https://github.com/NicolasDenoyelle/ Locality-Aware-Roofline-Model, 2017.

N. Denoyelle, B. Goglin, A. Ilic, E. Jeannot, and L. Sousa, Modeling Large Compute Nodes with??Heterogeneous Memories with??Cache-Aware Roofline Model, High Performance Computing Systems. Performance Modeling, Benchmarking, and Simulation -8th International Workshop Proceedings, pp.91-113, 2017.
DOI : 10.1109/HPCS.2017.150
URL : https://hal.archives-ouvertes.fr/hal-01622582

M. Dreher and B. Raffin, A Flexible Framework for Asynchronous in Situ and in Transit Analytics for Scientific Simulations, 2014 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, pp.277-286, 2014.
DOI : 10.1109/CCGrid.2014.92
URL : https://hal.archives-ouvertes.fr/hal-00941413

D. G. Feitelson, Job scheduling in multiprogrammed parallel systems (extended version), IBM Research Report RC19790, issue.87657, 1997.

A. Gainaru, G. Aupy, A. Benoit, F. Cappello, Y. Robert et al., Scheduling the I/O of HPC Applications Under Congestion, 2015 IEEE International Parallel and Distributed Processing Symposium, pp.1013-1022, 2015.
DOI : 10.1109/IPDPS.2015.116
URL : https://hal.archives-ouvertes.fr/hal-00983789

M. R. Garey and R. L. Graham, Bounds for Multiprocessor Scheduling with Resource Constraints, SIAM Journal on Computing, vol.4, issue.2, pp.187-200, 1975.
DOI : 10.1137/0204015

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

A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker et al., Dominant resource fairness: Fair allocation of multiple resource types, Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation, pp.323-336, 2011.

R. Grandl, G. Ananthanarayanan, S. Kandula, S. Rao, and A. Akella, Multi-resource packing for cluster schedulers, ACM SIGCOMM Computer Communication Review, vol.44, issue.4, pp.455-466, 2014.
DOI : 10.1007/s00778-012-0280-z

A. Guermouche, L. Marchal, B. Simon, and F. Vivien, Scheduling Trees of Malleable Tasks for Sparse Linear Algebra, Proceedings of the Euro-Par Conference, pp.479-490, 2015.
DOI : 10.1007/978-3-662-48096-0_37
URL : https://hal.archives-ouvertes.fr/hal-01160104

A. Hartstein, V. Srinivasan, T. Puzak, and P. Emma, On the nature of cache miss behavior: Is it ? 2? J. Instruction-Level Parallelism, 2008.

Y. He, J. Liu, and H. Sun, Scheduling Functionally Heterogeneous Systems with Utilization Balancing, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.1187-1198, 2011.
DOI : 10.1109/IPDPS.2011.113

Y. He, H. Sun, and W. Hsu, Adaptive Scheduling of Parallel Jobs on Functionally Heterogeneous Resources, 2007 International Conference on Parallel Processing (ICPP 2007), p.43, 2007.
DOI : 10.1109/ICPP.2007.12

K. Jansen and L. Porkolab, Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks, SODA, pp.490-498, 1999.
DOI : 10.1007/s00453-001-0085-8

W. Leinberger, G. Karypis, and V. Kumar, Job scheduling in the presence of multiple resource requirements, Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '99, 1999.
DOI : 10.1145/331532.331579

W. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, SODA, pp.167-176, 1994.

J. D. Mccalpin, STREAM: Sustainable memory bandwidth in high performance computers, 1991.

G. Mounié, C. Rapine, and D. Trystram, A $\frac32$???Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks, SIAM Journal on Computing, vol.37, issue.2, pp.401-412, 2007.
DOI : 10.1137/S0097539701385995

M. Noroozoliaee, B. Hamdaoui, M. Guizani, and M. B. , Online multi-resource scheduling for minimum task completion time in cloud servers, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2014.
DOI : 10.1109/INFCOMW.2014.6849261

G. N. Prasanna and B. R. Musicus, Generalized multiprocessor scheduling and applications to matrix computations, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.6, pp.650-664, 1996.
DOI : 10.1109/71.506703

P. Sanders and J. Speck, Efficient Parallel Scheduling of Malleable Tasks, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.1156-1166, 2011.
DOI : 10.1109/IPDPS.2011.110

H. Shachnai, J. J. Turek, I. T. Watson-research, and . Center, Multiresource malleable task scheduling, 1994.
DOI : 10.1016/s0020-0190(99)00030-7

M. Shantharam, Y. Youn, and P. Raghavan, SPEEDUP-AWARE CO-SCHEDULES FOR EFFICIENT WORKLOAD MANAGEMENT, Parallel Proc. Letters, p.2013
DOI : 10.1006/jcph.1995.1039

A. Sodani, R. Gramunt, J. Corbal, H. Kim, K. Vinod et al., Knights Landing: Second-Generation Intel Xeon Phi Product, IEEE Micro, vol.36, issue.2, pp.34-46, 2016.
DOI : 10.1109/MM.2016.25

J. Turek, J. L. Wolf, and P. S. Yu, Approximate algorithms scheduling parallelizable tasks, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures , SPAA '92, 1992.
DOI : 10.1145/140901.141909

A. B. Yoo, M. A. Jette, and M. Grondona, SLURM: Simple Linux Utility for Resource Management, JSSPP, pp.44-60, 2003.
DOI : 10.1007/10968987_3
URL : http://www.cs.huji.ac.il/~feit/parsched/p-03-3.ps.gz