S. Chakrabarti, J. Demmel, and K. Yelick, Modeling the benefits of mixed data and task parallelism, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures , SPAA '95, 1995.
DOI : 10.1145/215399.215423

D. Feitelson, L. Rudolph, and U. Schwiegelshohn, Parallel Job Scheduling ??? A Status Report, Proceedings of the 10th Workshop on Job Scheduling Strategies for Parallel Processing, pp.1-16, 2004.
DOI : 10.1007/11407522_1

N. Capit, G. Da-costa, Y. Georgiou, G. Huard, C. Martin et al., A batch scheduler with high level components, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005., 2005.
DOI : 10.1109/CCGRID.2005.1558641
URL : https://hal.archives-ouvertes.fr/hal-00005106

L. Eyraud, A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms, International Journal of High Performance Computing Applications, vol.20, issue.4, pp.507-516, 2006.
DOI : 10.1177/1094342006068405
URL : https://hal.archives-ouvertes.fr/hal-00688463

N. Vydyanathan, S. Krishnamoorthy, G. Sabin, U. Catalyurek, T. Kurc et al., An Integrated Approach for Processor Allocation and Scheduling of Mixed-Parallel Applications, 2006 International Conference on Parallel Processing (ICPP'06), 2006.
DOI : 10.1109/ICPP.2006.22

S. Bansal, P. Kumar, and K. Singh, An improved two-step algorithm for task and data parallel scheduling in distributed memory machines, Parallel Computing, vol.32, issue.10, pp.759-774, 2006.
DOI : 10.1016/j.parco.2006.08.004

T. N. Takpé and F. Suter, Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms, Proceedings of the 12th International Conferance on Parallel and Distributed Systems (ICPADS), 2006.

A. Radulescu and A. Van-gemund, A low-cost approach towards mixed task and data parallel scheduling, International Conference on Parallel Processing, 2001., 2001.
DOI : 10.1109/ICPP.2001.952048

T. N-'takpé, F. Suter, and H. Casanova, A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms, Proceedings of the 6th Int. Symposium on Parallel and Distributed Computing (ISPDC), 2007.

R. Lepere, D. Trystram, and G. Woeginger, Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints, Proceedings of the 9th Annual European Symposium on Algorithms -ESA 2001, ser. LNCS, pp.2161-146, 2001.

K. Jansen and H. Zhang, An approximation algorithm for scheduling malleable tasks under general precedence constraints, ACM Transactions on Algorithms, vol.2, issue.3, pp.416-434, 2006.
DOI : 10.1145/1159892.1159899

P. Dutot, T. N-'takpé, F. Suter, and H. Casanova, Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.7, pp.940-952, 2009.
DOI : 10.1109/TPDS.2009.11
URL : https://hal.archives-ouvertes.fr/inria-00347273

H. Casanova, A. Legrand, and M. Quinson, SimGrid: A Generic Framework for Large-Scale Distributed Experiments, Tenth International Conference on Computer Modeling and Simulation (uksim 2008), 2008.
DOI : 10.1109/UKSIM.2008.28
URL : https://hal.archives-ouvertes.fr/inria-00260697

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990.

A. Amar, R. Bolze, Y. Caniou, E. Caron, A. Chis et al., Tunable scheduling in a GridRPC framework, Concurrency and Computation: Practice and Experience, vol.19, issue.9, pp.1051-1069, 2008.
DOI : 10.1002/cpe.1283
URL : https://hal.archives-ouvertes.fr/hal-01428209