V. Lee, C. Kim, J. Chhugani, M. Deisher, D. Kim et al., Debunking the 100x gpu vs. cpu myth: an evaluation of throughput computing on cpu and gpu, pp.451-460, 2010.

D. Hochbaum and D. Shmoys, A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach, SIAM Journal on Computing, vol.17, issue.3, pp.539-551, 1988.
DOI : 10.1137/0217033

V. Bonifaci and A. Wiese, Scheduling unrelated machines of few different types, CoRR, 2012.

F. Pinel, B. Dorronsoro, and P. Bouvry, Solving very large instances of the scheduling of independent tasks problem on the GPU, Journal of Parallel and Distributed Computing, vol.73, issue.1, 2012.
DOI : 10.1016/j.jpdc.2012.02.018

E. Agullo, C. Augonnet, J. Dongarra, M. Faverge, H. Ltaief et al., QR Factorization on a Multicore Node Enhanced with Multiple GPU Accelerators, 2011 IEEE International Parallel & Distributed Processing Symposium, 2011.
DOI : 10.1109/IPDPS.2011.90

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

F. Song, S. Tomov, and J. Dongarra, Enabling and scaling matrix computations on heterogeneous multi-core and multi-GPU systems, Proceedings of the 26th ACM international conference on Supercomputing, ICS '12, 2012.
DOI : 10.1145/2304576.2304625

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.5355

A. Boukerche, J. Correa, A. Melo, and R. Jacobi, A Hardware Accelerator for the Fast Retrieval of DIALIGN Biological Sequence Alignments in Linear Space, IEEE Transactions on Computers, vol.59, issue.6, pp.808-821, 2010.
DOI : 10.1109/TC.2010.42

J. Phillips, J. Stone, and K. Schulten, Adapting a message-driven parallel application to gpuaccelerated clusters, SC, 2008.

J. Bueno, J. Planas, A. Duran, R. Badia, X. Martorell et al., Productive Programming of GPU Clusters with OmpSs, 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp.557-568, 2012.
DOI : 10.1109/IPDPS.2012.58

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, issue.4, pp.187-198, 2011.
DOI : 10.1002/cpe.1631

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

T. Gautier, L. Ferreira, J. V. Maillard, N. Raffin, and B. , XKaapi: A Runtime System for Data-Flow Task Programming on Heterogeneous Architectures, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, 2013.
DOI : 10.1109/IPDPS.2013.66

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

L. Chen, D. Ye, and G. Zhang, Online Scheduling on a CPU-GPU Cluster, TAMC, vol.7876, pp.1-9, 2013.
DOI : 10.1007/978-3-642-38236-9_1

D. Hochbaum and D. Shmoys, Using dual approximation algorithms for scheduling problems theoretical and practical results, Journal of the ACM, vol.34, issue.1, pp.144-162, 1987.
DOI : 10.1145/7531.7535

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, issue.3, pp.260-274, 2002.
DOI : 10.1109/71.993206

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.122

S. Kedad-sidhoum, F. Monna, G. Mounié, and D. Trystram, Scheduling independent tasks on multicores with gpu accelerators, Proc. HeteroPar 2013, pp.228-237, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00921357

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

J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Handbook on Scheduling, From Theory to Applications, International Handbooks on Information Systems, 2007.

J. Lenstra, D. Shmoys, and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, vol.23, issue.1-3, pp.259-271, 1988.
DOI : 10.1007/BF01585745

D. Shmoys and E. Tardos, An approximation algorithm for the generalized assignment problem, Mathematical Programming, vol.46, issue.1-3, pp.461-474, 1993.
DOI : 10.1007/BF01585178

E. Shchepin and N. Vakhania, An optimal rounding gives a better approximation for scheduling unrelated machines, Operations Research Letters, vol.33, issue.2, pp.127-133, 2004.
DOI : 10.1016/j.orl.2004.05.004

D. Friesen, Tighter Bounds for LPT Scheduling on Uniform Processors, SIAM Journal on Computing, vol.16, issue.3, pp.554-560, 1987.
DOI : 10.1137/0216037

V. Nélis and G. Raravi, A ptas for assigning sporadic tasks on two-type heterogeneous multiprocessors, RTSS, 2012.

C. Imreh, Scheduling Problems on Two Sets of Identical Machines, Computing, vol.70, issue.4, pp.277-294, 2003.
DOI : 10.1007/s00607-003-0011-9

S. Seifu, Scheduling on heterogeneous cluster environments, 2012.

E. Agullo, J. Demmel, J. Dongarra, B. Hadri, J. Kurzak et al., Numerical linear algebra on emerging architectures: The PLASMA and MAGMA projects, Journal of Physics: Conference Series, vol.180, 2009.
DOI : 10.1088/1742-6596/180/1/012037

R. Bolze, F. Cappello, E. Caron, M. Daydé, F. Desprez et al., Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed, International Journal of High Performance Computing Applications, vol.20, issue.4, pp.481-494, 2006.
DOI : 10.1177/1094342006070078

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

R. Bleuse, T. Gautier, J. Lima, G. Mounié, and D. Trystram, Scheduling Data Flow Program in XKaapi: A New Affinity Based Algorithm for Heterogeneous Architectures, 20th International European Conference on Parallel Processing, ARCoSS, 2014.
DOI : 10.1007/978-3-319-09873-9_47

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