V. W. 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, Proceedings of the 37th Annual International Symposium on Computer Architecture (ISCA'10)
DOI : 10.1145/1816038.1816021

Y. Abe, H. Sasaki, M. Peres, K. Inoue, K. Murakami et al., Power and performance analysis of GPU-accelerated systems, Proceedings of the 2012 USENIX conference on Power-Aware Computing and Systems (HotPower), pp.10-10, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00918053

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
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, pp.365-376, 2012.
DOI : 10.1145/2304576.2304625
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.5355

A. Boukerche, J. M. Correa, A. Melo, and R. P. 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. C. Phillips, J. E. Stone, and K. Schulten, Adapting a message-driven parallel application to GPU-accelerated clusters, 2008 SC, International Conference for High Performance Computing, Networking, Storage and Analysis, pp.1-8, 2008.
DOI : 10.1109/SC.2008.5214716
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.8204

R. Bleuse, S. Kedad-sidhoum, F. Monna, G. Mounié, and D. Trystram, Scheduling independent tasks on multi-cores with GPU accelerators, Concurrency and Computation: Practice and Experience, pp.1625-1638, 2015.
DOI : 10.1002/cpe.3359
URL : https://hal.archives-ouvertes.fr/hal-01081625

F. Monna, Scheduling for new computing platforms with GPUs, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01127919

R. P. Brent, The Parallel Evaluation of General Arithmetic Expressions, Journal of the ACM, vol.21, issue.2, pp.201-206, 1974.
DOI : 10.1145/321812.321815

J. K. Lenstra, D. B. Shmoys, and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, pp.259-271, 1990.
DOI : 10.1007/978-3-642-73778-7_165
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.708

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

E. V. 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

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

É. Blayo, L. Debreu, G. Mounié, and D. Trystram, Euro-Par'99, Dynamic Load Balancing for Ocean Circulation Model with Adaptive Meshing, pp.303-312, 1999.

L. Eyraud, Théorie et pratique de l'ordonnancement d'applications sur les systèmes distribués, 2006.

K. Jansen and L. Porkolab, Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks, Algorithmica, vol.32, issue.3, pp.507-520, 2002.
DOI : 10.1007/s00453-001-0085-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9750

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

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

M. Bougeret, P. Dutot, K. Jansen, C. Otte, and D. Trystram, A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling, Proceedings of the Euro-Par 2010, ser, pp.157-167, 2010.
DOI : 10.1007/978-3-642-15277-1_16
URL : https://hal.archives-ouvertes.fr/hal-00738518

W. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94). Society for Industrial and Applied Mathematics, pp.1670-176, 1994.

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

L. Fan, F. Zhang, G. Wang, and Z. Liu, An effective approximation algorithm for the Malleable Parallel Task Scheduling problem, Journal of Parallel and Distributed Computing, vol.72, issue.5, pp.693-704, 2012.
DOI : 10.1016/j.jpdc.2012.01.011

S. Hunold, One step toward bridging the gap between theory and practice in moldable task scheduling with precedence constraints, Concurrency and Computation: Practice and Experience, pp.1010-1026, 2015.
DOI : 10.1002/cpe.3372

D. S. Hochbaum and D. B. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.5753

M. R. Garey and R. L. Grahams, Bounds for Multiprocessor Scheduling with Resource Constraints, SIAM Journal on Computing, vol.4, issue.2, pp.187-200, 1975.
DOI : 10.1137/0204015
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.4205

A. Steinberg, A Strip-Packing Algorithm with Absolute Performance Bound 2, SIAM Journal on Computing, vol.26, issue.2, pp.401-409, 1997.
DOI : 10.1137/S0097539793255801

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

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, pp.187-198, 2011.
DOI : 10.1007/978-3-642-03869-3_80
URL : https://hal.archives-ouvertes.fr/inria-00384363

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, T. Hérault et al., PaRSEC: Exploiting Heterogeneity to Enhance Scalability, Computing in Science & Engineering, vol.15, issue.6, pp.36-45, 2013.
DOI : 10.1109/MCSE.2013.98

E. Shmueli and D. G. Feitelson, On Simulation and Design of Parallel-Systems Schedulers: Are We Doing the Right Thing?, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.7, pp.983-996, 2009.
DOI : 10.1109/TPDS.2008.152

J. Bezanson, A. Edelman, S. Karpinski, and V. B. Shah, Julia: A Fresh Approach to Numerical Computing, SIAM Review, vol.59, issue.1, 1411.
DOI : 10.1137/141000671
URL : http://arxiv.org/abs/1411.1607

S. Kedad, Informatique de Paris 6) as Assistant Professor in the team « Operations Research from Ecole Centrale Paris, and an HdR degree from Pierre et Marie Curie University in She spent two years (97-99) in Dynasys as a Project Manager in Supply Chain planning. She received a CNRS-Google Focused Research Award in 2011. She is a member of the steering committee of the International Workshop on Lot-Sizing (IWLS) since 2010 (every year) She is a member of the organizing committee of the challenge ROADEF/EURO since 2012, She participated to several research projects including ANR (LMCO), FUI (RCSM, DematFactory) and PEPS (COOL) projects. Her research interests include combinatorial optimization, supply chain, scheduling theory, planning and lot-sizing, 1997.