?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

?. ?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?-?,

A. Aggarwal and J. Vitter, The input/output complexity of sorting and related problems, Communications of the ACM, vol.31, issue.9, pp.1116-1127, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00075827

E. Agullo, On the Out-Of-Core Factorization of Large Sparse Matrices, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00563463

E. Agullo, A. Buttari, A. Guermouche, and F. Lopez, Implementing multifrontal sparse solvers for multicore architectures with sequential task flow runtime systems, ACM Trans. Math. Softw, vol.43, issue.2, p.13, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01333645

E. Agullo, A. Guermouche, and J. Excellent, Reducing the I/O volume in sparse out-of-core multifrontal methods, SIAM Journal on Scientific Computing, vol.31, issue.6, pp.4774-4794, 2010.

P. R. Amestoy, I. S. Duff, J. Koster, and J. Excellent, A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00808293

P. R. Amestoy, A. Guermouche, J. -y.-l'excellent, and S. Pralet, Hybrid scheduling for the parallel solution of linear systems, Parallel Computing, vol.32, issue.2, pp.136-156, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070599

L. Arge, M. T. Goodrich, M. J. Nelson, and N. Sitchinava, Fundamental parallel algorithms for private-cache chip multiprocessors, Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), pp.197-206, 2008.

C. Augonnet, S. Thibault, R. Namyst, and P. Wacrenier, StarPU: a unified platform for task scheduling on heterogeneous multicore architectures. Concurrency and Computation: Practice and Experience, vol.23, pp.187-198, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00384363

G. Ballard, D. Becker, J. Demmel, J. J. Dongarra, and A. Druinsky, Inon Peled, Oded Schwartz, Sivan Toledo, and Ichitaro Yamazaki. Communication-avoiding symmetric-indefinite factorization, SIAM J. Matrix Analysis Applications, vol.35, issue.4, pp.1364-1406, 2014.

G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, Minimizing communication in numerical linear algebra, SIAM J. Matrix Analysis Applications, vol.32, issue.3, pp.866-901, 2011.

O. Beaumont, V. Boudet, F. Rastello, and Y. Robert, Partitioning a square into rectangles: Np-completeness and approximation algorithms, Algorithmica, vol.34, issue.3, pp.217-239, 2002.
URL : https://hal.archives-ouvertes.fr/hal-02101984

L. A. Belady, A study of replacement algorithms for a virtual-storage computer, IBM Systems Journal, vol.5, issue.2, pp.78-101, 1966.

V. Bharadwaj, D. Ghose, and T. G. Robertazzi, Divisible load theory: A new paradigm for load scheduling in distributed systems, Cluster Computing, vol.6, issue.1, 2003.

L. S. Blackford, J. Choi, A. Cleary, E. D'azevedo, J. Demmel et al., ScaLAPACK Users' Guide. SIAM, 1997.

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, A. Haidar et al., Flexible development of dense linear algebra algorithms on massively parallel architectures with DPLASMA, 12th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC'11), 2011.

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, T. Herault et al., PaRSEC: Exploiting heterogeneity for enhancing scalability, Computing in Science & Engineering, vol.15, issue.6, pp.36-45, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00930217

G. Bosilca, A. Bouteiller, A. Danalis, T. Herault, P. Lemarinier et al., DAGuE: A generic distributed DAG engine for high performance computing, 16th International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS'11), 2011.

G. Bosilca, A. Bouteiller, A. Danalis, T. Herault, P. Lemarinier et al., DAGuE: A generic distributed DAG engine for high performance computing, Parallel Computing, vol.38, issue.1, pp.37-51, 2012.

T. D. Braun, H. J. Siegel, N. Beck, L. L. Bölöni, M. Maheswaran et al.,

. Freund, A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems, Journal of Parallel and Distributed Computing, vol.61, issue.6, pp.810-837, 2001.

L. E. Cannon, A cellular computer to implement the Kalman filter algorithm, 1969.

M. Ceccarello and F. Silvestri, Experimental evaluation of multi-round matrix multiplication on mapreduce, Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp.119-132, 2015.

J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov et al., ScaLAPACK: a portable linear algebra library for distributed memory computers-design issues and performance, Computer Physics Communications, vol.97, issue.1-2, pp.1-15, 1996.

G. Paul, D. Constantine, and . Gleich, Tall and skinny QR factorizations in mapreduce architectures, Proceedings of the second international workshop on MapReduce and its applications, pp.43-50, 2011.

G. Cordasco, R. D. Chiara, and A. L. Rosenberg, Assessing the computational benefits of area-oriented dag-scheduling, Euro-Par 2011 Parallel Processing-17th International Conference, pp.180-192, 2011.

G. Cordasco and A. L. Rosenberg, On scheduling seriesparallel dags to maximize area, Int. J. Found. Comput. Sci, vol.25, issue.5, pp.597-622, 2014.

D. E. Culler, R. M. Karp, D. A. Patterson, A. Sahay, K. E. Schauser et al., Logp: Towards a realistic model of parallel computation, Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP), pp.1-12, 1993.

T. Davidovi´cdavidovi´c and L. Liberti, Nelson Maculan, and Nenad Mladenovi´cnovi´c. Towards the optimal solution of the multiprocessor scheduling problem with communication delays, MISTA Proceedings, 2007.

J. Dean and S. Ghemawat, MapReduce: Simplified data processing on large clusters, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.

J. Demmel, Communication-avoiding algorithms for linear algebra and beyond, 27th IEEE International Symposium on Parallel and Distributed Processing, p.585, 2013.

J. Demmel, L. Grigori, M. Hoemmen, and J. Langou, Communication-optimal parallel and sequential QR and LU factorizations, SIAM J. Scientific Computing, vol.34, issue.1, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00870930

F. Desprez, J. Dongarra, A. Petitet, C. Randriamaro, and Y. Robert, Scheduling block-cyclic array redistribution, IEEE Trans. Parallel Distributed Systems, vol.9, issue.2, pp.192-205, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00856854

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, vol.91, issue.2, pp.201-213, 2002.

J. Dongarra, J. Pineau, Y. Robert, Z. Shi, and F. Vivien, Revisiting matrix product on master-worker platforms, Int. J. Found. Comput. Sci, vol.19, issue.6, pp.1317-1336, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00117050

M. Drozdowski, Scheduling parallel tasks-algorithms and complexity, 2004.

P. Dutot, K. Rzadca, E. Saule, and D. Trystram, Multiobjective scheduling, Introduction to Scheduling, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00800427

V. Elango, F. Rastello, L. Pouchet, J. Ramanujam, and P. Sadayappan, On characterizing the data access complexity of programs, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp.567-580, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01104556

D. Eppstein, Parallel recognition of series-parallel graphs. Information and Computation, vol.98, pp.41-55, 1992.

L. Finta and Z. Liu, Ioannis Mills, and Evripidis Bampis. Scheduling uet-uct series-parallel graphs on two processors, Theoretical Computer Science, vol.162, issue.2, pp.323-340, 1996.

P. Flajolet, J. Raoult, and J. Vuillemin, The number of registers required for evaluating arithmetic expressions, Theoretical Computer Science, vol.9, issue.1, pp.99-125, 1979.

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cache-oblivious algorithms, FOCS'99, the 40th IEEE Symposium on Foundations of Computer Science, pp.285-298, 1999.

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cache-oblivious algorithms, 40th Annual Symposium on Foundations of Computer Science, FOCS '99, pp.285-298, 1999.

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

N. Gast, B. Gaujal, and J. Boudec, Mean field for Markov Decision Processes: from Discrete to Continuous Optimization, IEEE Transactions on Automatic Control, vol.57, issue.9, pp.2266-2280, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00787996

T. Gautier, X. Besseron, and L. Pigeon, Kaapi: A thread scheduling runtime system for data flow computations on cluster of multi-processors, Proceedings of the 2007 International Workshop on Parallel Symbolic Computation, PASCO '07, pp.15-23, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00684843

J. R. Gilbert, T. Lengauer, and R. E. Tarjan, The pebbling problem is complete in polynomial space, SIAM J. Comput, vol.9, issue.3, pp.513-524, 1980.

A. González-escribano, J. C. Arjan, V. Van-gemund, and . Cardeñoso-payo, Mapping unstructured applications into nested parallelism, High Performance Computing for Computational Science-VECPAR, pp.407-420, 2002.

R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal, XLV, issue.9, pp.1563-1581, 1966.

L. Susan, M. Graham, C. A. Snir, and . Patterson, Getting up to speed: The future of supercomputing, 2005.

L. Hollermann, T. S. Hsu, D. R. Lopez, and K. Vertanen, Scheduling problems in a practical allocation model, J. Combinatorial Optimization, vol.1, issue.2, pp.129-149, 1997.

J. Hong and H. T. Kung, I/O complexity: The red-blue pebble game, STOC'81: Proceedings of the 13th ACM symposium on Theory of Computing, pp.326-333, 1981.

J. E. Hopcroft and R. M. Karp, An n 5/2 algorithm for maximum matching in bipartite graphs, SIAM Journal of Computing, vol.2, issue.4, pp.225-231, 1973.

T. S. Hsu, J. C. Lee, D. R. Lopez, and W. A. Royce, Task allocation on a network of processors, IEEE Trans. Computers, vol.49, issue.12, pp.1339-1353, 2000.

T. C. Hu, Parallel sequencing and assembly line problems, Operations Research, vol.9, pp.841-848, 1961.

D. Ironya, S. Toledo, and A. Tiskin, Communication lower bounds for distributed-memory matrix multiplication, J. Parallel Distributed Computing, vol.64, issue.9, pp.1017-1026, 2004.

M. Jacquelin, Memory-aware algorithms : from multicores to large scale platforms. (Algorithmes orientés mémoire : des processeurs multi-coeurs aux plates-formesàformes`formesà grandé echelle), 2011.
URL : https://hal.archives-ouvertes.fr/tel-00662525

M. Richard, V. Karp, and . Ramachandran, Parallel algorithms for shared-memory machines, In Handbook of Theoretical Computer Science, vol.A, pp.869-942, 1990.

F. Safia-kedad-sidhoum, D. Monna, and . Trystram, Scheduling tasks with precedence constraints on hybrid multi-core machines, International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp.27-33, 2015.

C. Lam, T. Rauber, G. Baumgartner, D. Cociorva, and P. Sadayappan, Memory-optimal evaluation of expression trees involving large objects, Computer Languages, Systems & Structures, vol.37, pp.63-75, 2011.

J. Langou, Communication lower bounds for matrix-matrix multiplication. Talk at the Dagstuhl Seminar 15281, 2015.

M. Lee and P. Michaud, Jeong Seop Sim, and DaeHun Nyang. A simple proof of optimality for the MIN cache replacement policy, Inf. Process. Lett, vol.116, issue.2, pp.168-170, 2016.

T. Lengauer, Black-white pebbles and graph separation, Acta Informatica, vol.16, issue.4, pp.465-475, 1981.

T. Lengauer and . Robert-e-tarjan, Asymptotically tight bounds on time-space trade-offs in a pebble game, Journal of the ACM, vol.29, issue.4, pp.1087-1130, 1982.

J. K. Lenstra, A. H. Rinnooy-kan, and P. Brucker, Complexity of machine scheduling problems, Annals of Discrete Mathematics, vol.1, pp.343-362, 1977.

W. H. Joseph and . Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Trans. Math. Software, vol.12, issue.3, pp.249-264, 1986.

W. H. Joseph and . Liu, An application of generalized tree pebbling to sparse matrix factorization, SIAM J. Algebraic Discrete Methods, vol.8, issue.3, pp.375-395, 1987.

H. Lynn, H. Loomis, and . Whitney, An inequality related to the isoperimetric inequality, Bulletin of the American Mathematical Society, vol.55, issue.10, pp.961-962, 1949.

F. Meyer-auf-der and H. , A comparison of two variations of a pebble game on graphs, Theoretical Computer Science, vol.13, issue.3, pp.315-322, 1981.

I. Lynette, . Millett, H. Samuel, and . Fuller, The Future of Computing Performance:: Game Over or Next Level?, 2011.

B. Monien and I. H. Sudborough, Min cut is NP-complete for edge weighted trees, Theoretical Computer Science, vol.58, issue.1, pp.209-229, 1988.

C. L. Monma and J. B. Sidney, Sequencing with seriesparallel precedence constraints, Mathematics of Operations Research, vol.4, issue.3, pp.215-224, 1979.

, OpenMP application program interface, OpenMP Architecture Review Board, 2013.

J. Planas, R. M. Badia, E. Ayguadé, and J. Labarta, Hierarchical task-based programming with, StarSs. IJHPCA, vol.23, issue.3, pp.284-299, 2009.

G. N. Srinivasa-prasanna and B. R. Musicus, Generalized multiprocessor scheduling and applications to matrix computations, IEEE TPDS, vol.7, issue.6, pp.650-664, 1996.

S. Sahni and G. Vairaktarakis, The master-slave scheduling model, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, 2004.

J. E. Savage, Models of Computation: Exploring the Power of Computing, 1997.

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol.24, 2003.

S. Seo, J. Edward-j-yoon, S. Kim, J. Jin, S. Kim et al., Hama: An efficient matrix computation with the mapreduce framework, Cloud Computing Technology and Science (CloudCom), pp.721-726, 2010.
DOI : 10.1109/cloudcom.2010.17

R. Sethi, Complete register allocation problems, Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOC'73), pp.182-195, 1973.
DOI : 10.1145/800125.804049

URL : http://graal.ens-lyon.fr/%7Elmarchal/scheduling/sethi_complete_register_allocation.pdf

R. Sethi and J. D. Ullman, The generation of optimal code for arithmetic expressions, J. ACM, vol.17, issue.4, pp.715-728, 1970.

J. Shalf, S. Sudip, J. Dosanjh, and . Morrison, Exascale computing technology challenges, 9th International conference on High Performance Computing for Computational Science-VECPAR 2010, pp.1-25, 2010.
DOI : 10.1007/978-3-642-19328-6_1

M. Stonebraker, J. Duggan, L. Battle, and O. Papaemmanouil, SciDB DBMS research at M.I.T. IEEE Data Eng. Bull, vol.36, issue.4, pp.21-30, 2013.

N. Arthur and . Strahler, Hypsometric (area-altitude) analysis of erosional topography, vol.63, pp.1117-1142, 1952.

S. Toledo, A survey of out-of-core algorithms in numerical linear algebra, External Memory Algorithms and Visualization, pp.161-180, 1999.

H. Topcuoglu, S. Hariri, and M. Y. Wu, Performance-effective and low-complexity task scheduling for heterogeneous computing, IEEE Trans. Parallel Distributed Systems, vol.13, issue.3, pp.260-274, 2002.
DOI : 10.1109/71.993206

URL : http://meseec.ce.rit.edu/eecc722-fall2002/papers/hc/5/l0260.pdf

J. Valdes, R. E. Tarjan, and E. L. Lawler, The recognition of series parallel digraphs, SIAM J. Comput, vol.11, issue.2, pp.298-313, 1982.

E. Peter-van, J. Boas, and . Van-leeuwen, Move rules and tradeoffs in the pebble game, Theoretical Computer Science 4th GI Conference, pp.101-112, 1979.

S. Venugopalan and O. Sinnen, Optimal linear programming solutions for multiprocessor scheduling with communication delays, vol.3, pp.129-138, 2012.
DOI : 10.1007/978-3-642-33078-0_10

J. S. Vitter, External memory algorithms, Handbook of massive data sets, pp.359-416, 2002.
DOI : 10.1007/978-1-4615-0005-6_10

M. Yannakakis, A polynomial algorithm for the min-cut linear arrangement of trees, Journal of the ACM (JACM), vol.32, issue.4, pp.950-988, 1985.

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Scheduling strategies for mixed data and task parallelism on heterogeneous clusters, Parallel Processing Letters, vol.13, issue.2, pp.225-244, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00789453

A. Legrand, L. Marchal, and Y. Robert, Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms, J. Parallel and Distributed Computing, vol.65, issue.12, pp.1497-1514, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00789447

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Steady-state scheduling on heterogeneous clusters, Int. J. of Foundations of Computer Science, vol.16, issue.2, pp.163-194, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00358951

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Pipelining broadcasts on heterogeneous platforms, IEEE Trans. Parallel Distributed Systems, vol.16, issue.4, pp.300-313, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00358950

L. Marchal, Y. Yang, H. Casanova, and Y. Robert, Steadystate scheduling of multiple divisible load applications on wide-area distributed computing platforms, Int. Journal of High Performance Computing Applications, vol.20, issue.3, pp.365-381, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00804394

O. Beaumont, L. Marchal, and Y. Robert, Complexity results for collective communications on heterogeneous platforms, Int. Journal of High Performance Computing Applications, vol.20, issue.1, pp.5-17, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00358948

L. Marchal, V. Rehn, Y. Robert, and F. Vivien, Scheduling algorithms for data redistribution and load-balancing on master-slave platforms, Parallel Processing Letters, vol.17, issue.1, pp.61-77, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00803512

O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal et al., Centralized versus distributed schedulers for multiple bag-of-task applications, IEEE Trans. Parallel Distributed Systems, vol.19, issue.5, pp.698-709, 2008.

A. Benoit, L. Marchal, J. Pineau, Y. Robert, and F. Vivien, Scheduling concurrent bag-of-tasks applications on heterogeneous platforms, IEEE Transactions on Computers, vol.59, issue.2, pp.202-217, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00786249

S. Diakité, L. Marchal, J. Nicod, and L. Philippe, Practical steady-state scheduling for tree-shaped task graphs, Parallel Processing Letters, vol.21, issue.4, pp.397-412, 2011.

T. David, M. Jacquelin, and L. Marchal, Scheduling streaming applications on a complex multicore platform, Concurrency and Computation: Practice and Experience, vol.24, issue.15, pp.1726-1750, 2012.
URL : https://hal.archives-ouvertes.fr/ensl-00523018

A. Benoit, L. Canon, and L. Marchal, Nonclairvoyant reduction algorithms for heterogeneous platforms, Concurrency and Computation: Practice and Experience, vol.27, pp.1612-1624, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00832102

J. Herrmann, L. Marchal, and Y. Robert, Memory-aware tree traversals with pre-assigned tasks, J. Parallel Distrib. Comput, vol.75, pp.53-66, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01026405

T. Lambert, L. Marchal, and B. Uçar, Comments on the hierarchically structured bin packing problem, Information Processing Letters, vol.115, issue.2, pp.306-309, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01071414

L. Eyraud-dubois, L. Marchal, O. Sinnen, and F. Vivien, Parallel scheduling of task trees with limited memory, ACM Transactions on Parallel Computing, vol.2, issue.2, p.36, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01160118

J. Herrmann, G. Bosilca, T. Hérault, L. Marchal, Y. Robert et al., Assessing the cost of redistribution followed by a computational kernel: Complexity and performance results, Parallel Computing, vol.52, p.20, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01254167

E. Kayaaslan, T. Lambert, L. Marchal, and B. Uçar, Scheduling series-parallel task graphs to minimize peak memory. Theoretical Computer Science, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01397299

L. Marchal, B. Simon, O. Sinnen, and F. Vivien, Malleable task-graph scheduling with a practical speed-up model, Transactions on Parallel and Distributed Systems, vol.29, issue.6, pp.1357-1370, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01687189

O. Beaumont and L. Marchal, Steady-state scheduling, Introduction to Scheduling, pp.159-186, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00344157

A. Benoit, L. Marchal, Y. Robert, and F. Vivien, Algorithms and scheduling techniques for clusters and grids, Advances in Parallel Computing, vol.18, pp.27-51, 2009.

A. Benoit, L. Marchal, Y. Robert, B. Uçar, and F. Vivien, Scheduling for large-scale systems, Computing Handbook, Third Edition: Computer Science and Software Engineering, vol.59, pp.1-33, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00763372

, International conference proceedings

H. Casanova, A. Legrand, and L. Marchal, Scheduling distributed applications: the simgrid simulation framework, IEEE International Symposium on Cluster Computing and the Grid (CCGrid), pp.138-145, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00789451

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms, International Conference on Parallel Processing (ICPP), pp.267-274, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00789448

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Pipelining broadcasts on heterogeneous platforms, IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2004.
URL : https://hal.archives-ouvertes.fr/hal-00807285

O. Beaumont, L. Marchal, and Y. Robert, Scheduling divisible loads with return messages on heterogeneous master-worker platforms, International Conference on High Performance Computing (HiPC), pp.498-507, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02102504

L. Marchal, P. Primet, Y. Robert, and J. Zeng, Optimizing network resource sharing in grids, IEEE Global Telecommunications Conference (GlobeCom), 2005.
URL : https://hal.archives-ouvertes.fr/inria-00071241

O. Beaumont, L. Marchal, and Y. Robert, Broadcast trees for heterogeneous platforms, IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2005.
URL : https://hal.archives-ouvertes.fr/hal-02101806

L. Marchal, Y. Yang, H. Casanova, and Y. Robert, A realistic network/application model for scheduling divisible loads on large-scale platforms, IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2005.
URL : https://hal.archives-ouvertes.fr/hal-00807014

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Independent and divisible tasks scheduling on heterogeneous starschaped platforms with limited memory, 13th Euromicro Conference on Parallel, Distributed and Network-based Processing (PDP), pp.179-186, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00789442

L. Marchal, P. Primet, Y. Robert, and J. Zeng, Optimal bandwidth sharing in grid environment, 15th International Symposium on High Performance Distributed Computing (HPDC), pp.144-155, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00804400

O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal et al., Centralized versus distributed schedulers for multiple bag-of-task applications, IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2006.

O. Beaumont, A. Kermarrec, L. Marchal, and E. Riviére, Voronet: A scalable object network based on voronoi tessellations, IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2007.
URL : https://hal.archives-ouvertes.fr/inria-00358953

L. Marchal, V. Rehn, Y. Robert, and F. Vivien, Scheduling and data redistribution strategies on star platforms, 15th Euromicro Conference on Parallel, Distributed and Networkbased Processing (PDP), pp.288-295, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00803522

M. Gallet, L. Marchal, and F. Vivien, Allocating series of workflows on computing grids, 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS), pp.48-55, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00308639

M. Gallet, L. Marchal, and F. Vivien, Efficient scheduling of task graph collections on heterogeneous resources, IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2009.
URL : https://hal.archives-ouvertes.fr/hal-00786257

S. Diakité, L. Marchal, J. Nicod, and L. Philippe, Steady-state for batches of identical task graphs, 15th International Euro-Par Conference, pp.203-215, 2009.

M. Jacquelin, L. Marchal, and Y. Robert, Complexity analysis and performance evaluation of matrix product on multicore architectures, International Conference on Parallel Processing (ICPP), pp.196-203, 2009.
URL : https://hal.archives-ouvertes.fr/ensl-00381458

J. Celaya and L. Marchal, A fair decentralized scheduler for bag-of-tasks applications on desktop grids, 10th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), pp.538-541, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00786250

A. Benoit, L. Marchal, O. Sinnen, and Y. Robert, Mapping pipelined applications with replication to increase throughput and reliability, 22nd International Symposium on Parallel and Distributed Computing (SBAC-PAD), 2010.
URL : https://hal.archives-ouvertes.fr/hal-01059633

M. Jacquelin, L. Marchal, Y. Robert, and B. Uçar, On optimal tree traversals for sparse matrix factorization, IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.556-567, 2011.
URL : https://hal.archives-ouvertes.fr/ensl-00527462

F. Cappello, M. Jacquelin, L. Marchal, Y. Robert, and M. Snir, Comparing archival policies for BlueWaters, International Conference on High Performance Computing (HiPC'2011), 2011.
URL : https://hal.archives-ouvertes.fr/hal-00945073

O. Beaumont, N. Bonichon, L. Eyraud-dubois, and L. Marchal, Minimizing weighted mean completion time for malleable tasks scheduling, IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.273-284, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00564056

L. Marchal, O. Sinnen, and F. Vivien, Scheduling treeshaped task graphs to minimize memory and makespan, IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.839-850, 2013.
DOI : 10.1109/ipdps.2013.55

URL : https://hal.archives-ouvertes.fr/hal-00788612

J. Herrmann, L. Marchal, and Y. Robert, Model and complexity results for tree traversals on hybrid platforms, 19th International Euro-Par Conference, pp.647-658, 2013.
DOI : 10.1007/978-3-642-40047-6_65

URL : https://hal.archives-ouvertes.fr/hal-00926502

O. Beaumont, H. Larchevêque, and L. Marchal, Non linear divisible loads: There is no free lunch, IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.863-873, 2013.
DOI : 10.1109/ipdps.2013.94

URL : https://hal.archives-ouvertes.fr/hal-00771640

T. Hérault, J. Herrmann, L. Marchal, and Y. Robert, Determining the optimal redistribution for a given data partition, IEEE 13th International Symposium on Parallel and Distributed Computing, (ISPDC), pp.95-102, 2014.

O. Beaumont and L. Marchal, Analysis of dynamic scheduling strategies for matrix multiplication on heterogeneous platforms, 23rd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC), pp.141-152, 2014.
DOI : 10.1145/2600212.2600223

URL : https://hal.archives-ouvertes.fr/hal-01090254

L. Abdou-guermouche, B. Marchal, F. Simon, and . Vivien, Scheduling Trees of Malleable Tasks for Sparse Linear Algebra, International European Conference on Parallel and Distributed Computing, 2015.

G. Aupy, C. Brasseur, and L. Marchal, Dynamic Memory-Aware Task-Tree Scheduling, IEEE International Parallel and Distributed Processing Symposium (IPDPS, 2017.
DOI : 10.1109/ipdps.2017.58

URL : https://hal.archives-ouvertes.fr/hal-01390107

L. Louis-claude-canon, F. Marchal, and . Vivien, Low-Cost Approximation Algorithms for Scheduling Independent Tasks on Hybrid Platforms, International European Conference on Parallel and Distributed Computing, 2017.

A. Benoit, C. Gou, and L. Marchal, Memory-aware tree partitioning on homogeneous platforms, 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), 2018.
URL : https://hal.archives-ouvertes.fr/hal-01892022

L. Marchal, H. Nagy, B. Simon, and F. Vivien, Parallel scheduling of DAGs under memory constraints, IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2018.
DOI : 10.1109/ipdps.2018.00030

URL : https://hal.archives-ouvertes.fr/hal-01828312

, International workshop proceedings

A. Legrand, L. Marchal, and Y. Robert, Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms, 6th Workshop on Advances in Parallel and Distributed Computational Models (APDCM, workshop of IPDPS), 2004.
URL : https://hal.archives-ouvertes.fr/hal-00789425

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Steady-state scheduling on heterogeneous clusters: why and how?, 6th Workshop on Advances in Parallel and Distributed Computational Models (APDCM, workshop of IPDPS), 2004.
URL : https://hal.archives-ouvertes.fr/hal-00789446

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogeneous platforms, HeteroPar (workshop of Euro-Par), pp.296-302, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00789444

O. Beaumont, L. Marchal, V. Rehn, and Y. Robert, FIFO scheduling of divisible loads with return messages under the one-port model, 15th Heterogeneous Computing Workshop (HCW, workshop of IPDPS), 2006.
URL : https://hal.archives-ouvertes.fr/inria-00407383

J. Digiovanna, L. Marchal, P. Rattanatamrong, M. Zhao, S. Darmanjian et al., Towards real-time distributed signal modeling for brain machine interfaces, Proceedings of Dynamic Data Driven Application Systems (workshop of ICCS), vol.4487, pp.964-971, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00803510

A. Benoit, L. Marchal, J. Pineau, Y. Robert, and F. Vivien, Offline and online scheduling of concurrent bags-oftasks on heterogeneous platforms, 10th Workshop on Advances in Parallel and Distributed Computational Models (APDCM, workshop of IPDPS), 2008.

A. Benoit, L. Marchal, J. Pineau, Y. Robert, and F. Vivien, Resource-aware allocation strategies for divisible loads on large-scale systems, 18th Heterogeneity in Computing Workshop, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00786256

M. Gallet, M. Jacquelin, and L. Marchal, Scheduling complex streaming applications on the cell processor, Workshop on Multithreaded Architectures and Applications (MTAAP, workshop of IPDPS), 2010.
URL : https://hal.archives-ouvertes.fr/ensl-00421210

A. Benoit, L. Canon, and L. Marchal, Nonclairvoyant reduction algorithms for heterogeneous platforms, HeteroPar (workshop of Euro-Par), pp.270-279, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01090232

J. Herrmann, L. Marchal, and Y. Robert, Memory-aware list scheduling for hybrid platforms, 23rd Heterogeneity in Computing Workshop (HCW, workshop of IPDPS), pp.689-698, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00944336

E. Agullo, O. Beaumont, L. Eyraud-dubois, J. Herrmann, S. Kumar et al., Bridging the Gap between Performance and Bounds of Cholesky Factorization on Heterogeneous Platforms, 24th Heterogeneity in Computing Workshop (HCW, workshop of IPDPS), 2015.
URL : https://hal.archives-ouvertes.fr/hal-01120507

F. Hanna, L. Marchal, J. Nicod, L. Philippe, V. Rehn-sonigo et al., Minimizing Rental Cost for Multiple Recipe Applications in the Cloud, 25th Heterogeneity in Computing Workshop (HCW, workshop of IPDPS), pp.28-37, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01356152

L. Marchal, S. Mccauley, B. Simon, and F. Vivien, Minimizing I/Os in Out-of-Core Task Tree Scheduling, 19th Workshop on Advances in Parallel and Distributed Computational Models (APDCM, workshop of IPDPS, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01462213

O. Beaumont, T. Lambert, L. Marchal, and B. Thomas, Data-locality aware dynamic schedulers for independent tasks with replicated inputs, 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS Workshops, pp.1206-1213, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01878977

L. Marchal, Communications collectives et ordonnancement en régime permanent sur plates-formes hétérogènes, 2006.

B. , , vol.6

L. Marchal, S. Mccauley, B. Simon, and F. Vivien, Minimizing I/Os in Out-of-Core Task Tree Scheduling. Research Report RR-9025, INRIA, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01462213