D. Barthou and E. Jeannot, Spaghetti: Scheduling/placement approach for task-graphs on heterogeneous architecture, Euro-Par 2014 Parallel Processing, pp.174-185, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01100948

M. Dorier, M. Dreher, T. Peterka, J. M. Wozniak, G. Antoniu et al., Lessons learned from building in situ coupling frameworks, Proceedings of the First Workshop on In Situ Infrastructures for Enabling Extreme-Scale Analysis and Visualization, pp.19-24, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01224846

M. Asch, T. Moore, R. Badia, M. Beck, P. Beckman et al., Big data and extreme-scale computing: Pathways to convergence-toward a shaping strategy for a future software and data ecosystem for scientific inquiry, The International Journal of High Performance Computing Applications, vol.32, issue.4, pp.435-479, 2018.

X. Yang, C. Wu, K. Lu, L. Fang, Y. Zhang et al., An interface for biomedical big data processing on the tianhe-2 supercomputer, Molecules, vol.22, issue.12, 2017.

I. Raicu, I. T. Foster, and Y. Zhao, Many-task computing for grids and supercomputers, Many-Task Computing on Grids and Supercomputers, pp.1-11, 2008.

R. M. Karp, Reducibility among combinatorial problems, Complexity of computer computations, pp.85-103, 1972.

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

B. Schoenmakers, A new algorithm for the recognition of series parallel graphs, ser. CWI report, CS-R. CWI, 1995.

L. Marchal, L. Canon, and F. Vivien, Low-cost approximation algorithms for scheduling independent tasks on hybrid platforms, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01559898

S. Kedad-sidhoum, F. Monna, G. Mounié, and D. Trystram, A family of scheduling algorithms for hybrid parallel platforms, International Journal of Foundations of Computer Science, vol.29, issue.01, pp.63-90, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01516700

J. K. Lenstra, D. B. Shmoys, and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical programming, vol.46, issue.1-3, pp.259-271, 1990.

S. Kedad-sidhoum, F. Monna, and D. Trystram, Scheduling tasks with precedence constraints on hybrid multi-core machines, pp.27-33, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01230286

M. Amaris, G. Lucarelli, C. Mommessin, and D. Trystram, Generic algorithms for scheduling applications on hybrid multi-core machines, European Conference on Parallel Processing, pp.220-231, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01420798

F. A. Chudak and D. B. Shmoys, Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds, Journal of Algorithms, vol.30, issue.2, pp.323-343, 1999.

M. Aba, L. Zaourar, and A. Munier, Approximation algorithm for scheduling applications on hybrid multi-core machines with communications delays, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02073600

R. Bajaj and D. P. , Improving scheduling of tasks in a heterogeneous environment, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.2, pp.107-118, 2004.

Y. Kwok and I. Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Surveys (CSUR), vol.31, issue.4, pp.406-471, 1999.

S. Darbha and D. P. , Optimal scheduling algorithm for distributed-memory machines, IEEE transactions on parallel and distributed systems, vol.9, pp.87-95, 1998.

C. Park and T. Choe, An optimal scheduling algorithm based on task duplication, Proceedings. Eighth International Conference on, pp.9-14, 2001.

A. S. Wu, H. Yu, S. Jin, K. Lin, and G. Schiavone, An incremental genetic algorithm approach to multiprocessor scheduling, IEEE Transactions on parallel and distributed systems, vol.15, pp.824-834, 2004.

H. Topcuoglu, S. Hariri, and M. Wu, Performance-effective and low-complexity task scheduling for heterogeneous computing, IEEE transactions on parallel and distributed systems, vol.13, pp.260-274, 2002.

C. Boeres and V. E. Rebello, A cluster-based strategy for scheduling task on heterogeneous processors, Computer Architecture and High Performance Computing, 2004. SBAC-PAD 2004. 16th Symposium on, pp.214-221, 2004.

T. Yang and A. Gerasoulis, Dsc: Scheduling parallel tasks on an unbounded number of processors, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.9, pp.951-967, 1994.

M. R. Garey and D. S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal on Computing, vol.4, issue.4, pp.397-411, 1975.

L. F. Bittencourt, R. Sakellariou, and E. R. Madeira, Dag scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm, Parallel, Distributed and NetworkBased Processing (PDP), pp.27-34, 2010.

M. A. Khan, Scheduling for heterogeneous systems using constrained critical paths, Parallel Computing, vol.38, pp.175-193, 2012.

H. Arabnejad and J. G. Barbosa, List scheduling algorithm for heterogeneous systems by an optimistic cost table, IEEE Transactions on Parallel and Distributed Systems, vol.25, issue.3, pp.682-694, 2014.

S. Kushwaha and S. Kumar, An investigation of list heuristic scheduling algorithms for multiprocessor system, IUP Journal of Computer Sciences, vol.11, issue.2, 2017.

H. Wang and O. Sinnen, List-scheduling vs. cluster-scheduling, IEEE Transactions on Parallel and Distributed Systems, 2018.

T. Yang and A. Gerasoulis, A fast static scheduling algorithm for dags on an unbounded number of processors, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, pp.633-642, 1991.