V. Boudet, F. Desprez, and F. Suter, One-step algorithm for mixed data and task parallel scheduling without data replication, Proceedings International Parallel and Distributed Processing Symposium, 2003.
DOI : 10.1109/IPDPS.2003.1213127

URL : https://hal.archives-ouvertes.fr/lirmm-00269808

H. Casanova, F. Desprez, and F. Suter, From Heterogeneous Task Scheduling to Heterogeneous Mixed Parallel Scheduling, 10th Int. Euro-Par Conference, pp.230-237, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071583

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, pp.74-83, 1995.
DOI : 10.1145/215399.215423

Y. Kwok and I. Ahmad, Benchmarking and Comparison of the Task Graph Scheduling Algorithms, Journal of Parallel and Distributed Computing, vol.59, issue.3, pp.381-422, 1999.
DOI : 10.1006/jpdc.1999.1578

A. Legrand, L. Marchal, and H. Casanova, Scheduling distributed applications: the SimGrid simulation framework, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings., pp.138-145, 2003.
DOI : 10.1109/CCGRID.2003.1199362

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

R. Lepère, D. Trystram, and G. Woeginger, APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS, International Journal of Foundations of Computer Science, vol.13, issue.04, pp.613-627, 2002.
DOI : 10.1142/S0129054102001308

W. Ludwig and P. Tiwari, Scheduling Malleable and Nonmalleable Tasks, Symp. on Discrete Algorithms (SODA), pp.167-176, 1994.

T. N. Takpé and F. Suter, Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms, 12th Int. Conf. on Parallel and Distributed Systems (ICPADS), pp.3-10, 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

S. Ramaswany, Simultaneous Exploitation of Task and Data Parallelism in Regular Scientific Applications, 1996.

T. Rauber and G. Rünger, Compiler support for task scheduling in hierarchical execution models, Journal of Systems Architecture, vol.45, issue.6-7, pp.483-503, 1998.
DOI : 10.1016/S1383-7621(98)00019-8

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

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