P. Brucker and S. Knust, Complexity results for scheduling problems Web document

J. K. Lenstra, D. B. Shmoys, and É. Tardos, Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming, 1990.
DOI : 10.1109/sfcs.1987.8

URL : https://ir.cwi.nl/pub/18055/18055A.pdf

R. Bleuse, S. Kedad-sidhoum, F. Monna, G. Mounié, and D. Trystram, Scheduling Independent Tasks on Multi-cores with GPU Accelerators, Concurr. Comput. : Pract. Exper, vol.27, issue.6, pp.1625-1638, 2015.
DOI : 10.1002/cpe.3359

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

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, Special Issue: Euro-Par, vol.23, pp.187-198, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00384363

J. Planas, M. Rosa, E. Badia, J. Ayguadé, and . Labarta, Hierarchical task-based programming with StarSs, International Journal of High Performance Computing Applications, vol.23, issue.3, pp.284-299, 2009.
DOI : 10.1177/1094342009106195

E. Chan, G. Field, P. Van-zee, E. S. Bientinesi, G. Quintana-orti et al., SuperMatrix: A multithreaded runtime scheduling system for algorithms-by-blocks, 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, pp.123-132, 2008.

A. Yarkhan, J. Kurzak, and J. Dongarra, QUARK Users' Guide: QUeueing And Runtime for Kernels, vol.2011

E. Hermann, B. Raffin, F. Faure, T. Gautier, and J. Allard, Multi-GPU and Multi-CPU Parallelization for Interactive Physics Simulations, Euro-Par, issue.2, pp.235-246, 2010.
DOI : 10.1007/978-3-642-15291-7_23

URL : https://hal.archives-ouvertes.fr/inria-00502448

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, T. Hérault et al., PaRSEC: A programming paradigm exploiting heterogeneity for enhancing scalability, Computing in Science and Engineering, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00930217

V. Bonifaci and A. Wiese, Scheduling Unrelated Machines of Few Different Types, CoRR, 2012.

H. Topcuouglu, S. Hariri, and M. Wu, Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing, IEEE Trans. Parallel Distrib. Syst, vol.13, issue.3, pp.260-274, 2002.

L. Louis-claude-canon, F. Marchal, and . Vivien, Low-Cost Approximation Algorithms for Scheduling Independent Tasks on Hybrid Platforms, European Conference on Parallel Processing, pp.232-244, 2017.

E. Agullo, O. Beaumont, L. Eyraud-dubois, and S. Kumar, Are Static Schedules so Bad? A Case Study on Cholesky Factorization, 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, pp.1021-1030, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01223573

N. Cheriere and E. Saule, Considerations on distributed load balancing for fully heterogeneous machines: Two particular cases, Parallel and Distributed Processing Symposium Workshop (IPDPSW), pp.6-16, 2015.

O. Beaumont, L. Eyraud-dubois, and S. Kumar, Approximation Proofs of a Fast and Efficient List Scheduling Algorithm for Task-Based Runtime Systems on Multicores and GPUs, IEEE International Parallel & Distributed Processing Symposium, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01386174

S. Kumar, Scheduling of Dense Linear Algebra Kernels on Heterogeneous Resources, 2017.
URL : https://hal.archives-ouvertes.fr/tel-01538516

E. Agullo, B. Bramas, O. Coulaud, E. Darve, M. Messner et al., Task-based FMM for heterogeneous architectures, Concurrency and Computation: Practice and Experience, vol.28, issue.9, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00974674

L. Eugene, J. Lawler, and . Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming, Journal of the ACM (JACM), vol.25, issue.4, pp.612-619, 1978.

V. Evgeny, N. Shchepin, and . Vakhania, An optimal rounding gives a better approximation for scheduling unrelated machines, Operations Research Letters, 2005.

C. Imreh, Scheduling Problems on Two Sets of Identical Machines, Computing, vol.70, issue.4, pp.277-294, 2003.

L. Chen, D. Ye, and G. Zhang, Online Scheduling of mixed CPU-GPU jobs, International Journal of Foundations of Computer Science, vol.25, issue.06, pp.745-761, 2014.

R. Bleuse, T. Gautier, V. F. João, G. Lima, D. Mounié et al., Scheduling Data Flow Program in XKaapi: A New Affinity Based Algorithm for Heterogeneous Architectures, pp.560-571, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01081629

A. Fabián, D. B. Chudak, and . 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.

C. Chekuri and M. Bender, An efficient approximation algorithm for minimizing makespan on uniformly related machines, Lecture Notes in Computer Science, vol.1412, pp.383-393, 1998.

J. Gerhard and . Woeginger, A comment on scheduling on uniform machines under chain-type precedence constraints, Operations Research Letters, vol.26, issue.3, pp.107-109, 2000.

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

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

R. L. Graham, Bounds on multiprocessing timing anomalies, SIAM journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.

. Chameleon, A dense linear algebra software for heterogeneous architectures, 2014.

, Experimental repository for the present paper, 2017.