T. L. Adam, K. M. Chandy, and J. Dickson, A comparison of list schedules for parallel processing systems, Communications of the ACM, vol.17, issue.12, pp.685-690, 1974.

I. Ahmad and Y. Kwok, On exploiting task duplication in parallel program scheduling, IEEE T. Parall. Distr, vol.9, issue.9, pp.872-892, 1998.

T. A. Davis and Y. Hu, The University of Florida sparse matrix collection, ACM Trans. Math. Softw, vol.38, issue.1, 2011.

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles. Mathematical programming, vol.91, pp.201-213, 2002.

I. T. Foster, M. Fidler, A. Roy, V. Sander, and L. Winkler, End-to-end quality of service for high-end applications, Computer Communications, vol.27, issue.14, pp.1375-1388, 2004.

M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1979.

A. Gerasoulis and T. Yang, On the granularity and clustering of directed acyclic task graphs, IEEE T. Parall. Distr, vol.4, issue.6, pp.686-701, 1993.

T. Glatard, J. Montagnat, D. Lingrand, and X. Pennec, Flexible and efficient workflow deployement of data-intensive applications on grids with MOTEUR. Int, Journal of High Performance Computing and Applications, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00459130

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

C. Hanen and A. Munier, An approximation algorithm for scheduling dependent tasks on m processors with small communication delays, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95, vol.1, pp.167-189, 1995.
URL : https://hal.archives-ouvertes.fr/hal-01185825

J. Herrmann, M. Y. Özkaya, B. Uçar, K. Kaya, and Ü. V. Çatalyürek, Acyclic partitioning of large directed acyclic graphs, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01672010

J. Hwang, Y. Chow, F. D. Anger, and C. Lee, Scheduling precedence graphs in systems with interprocessor communication times, SIAM Journal on Computing, vol.18, issue.2, pp.244-257, 1989.
DOI : 10.1137/0218016

K. Jansen, F. Land, and M. Kaluza, Precedence scheduling with unit execution time is equivalent to parametrized biclique, SOFSEM 2016: Theory and Practice of Computer Science, pp.329-343, 2016.
DOI : 10.1007/978-3-662-49192-8_27

H. Kanemitsu, M. Hanada, and H. Nakazato, Clustering-based task scheduling in a large number of heterogeneous processors, IEEE T. Parall. Distr, vol.27, issue.11, pp.3144-3157, 2016.

Y. Kwok and I. Ahmad, Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors, IEEE T. Parall. Distr, vol.7, issue.5, pp.506-521, 1996.

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
URL : http://www.eee.hku.hk/~ykwok/papers/compare-jpdc.pdf

Y. Kwok and I. Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Comput. Surv, vol.31, issue.4, pp.406-471, 1999.
DOI : 10.1145/344588.344618
URL : http://reptar.uta.edu/NOTES4351/taskSurvey.pdf

S. Mingsheng, S. Shixin, and W. Qingxian, An efficient parallel scheduling algorithm of dependent task graphs, Proc. of 4th Int. Conf. on Parallel and Distributed Computing, Applications and Technologies, PDCAT, pp.595-598, 2003.

C. Picouleau, New complexity results on scheduling with small communication delays, Discrete Applied Mathematics, vol.60, issue.1, pp.331-342, 1995.
DOI : 10.1016/0166-218x(94)00063-j
URL : https://doi.org/10.1016/0166-218x(94)00063-j

A. Radulescu and A. J. Van-gemund, Low-cost task scheduling for distributed-memory machines, IEEE T. Parall. Distr, vol.13, issue.6, pp.648-658, 2002.
DOI : 10.1109/tpds.2002.1011417
URL : http://rama.pds.twi.tudelft.nl/~gemund/Publications/tpds02.pdf

V. Sarkar, Partitioning and scheduling parallel programs for execution on multiprocessors, 1987.

G. C. Sih and E. A. Lee, A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures, IEEE T. Parall. Distr, vol.4, issue.2, pp.175-187, 1993.
DOI : 10.1109/71.207593

O. Sinnen, Task Scheduling for Parallel Systems, Wiley Series on Par.and Distr. Computing, 2007.
DOI : 10.1002/0470121173
URL : https://onlinelibrary.wiley.com/doi/pdf/10.1002/9780470121177.fmatter

O. Svensson, Conditional hardness of precedence constrained scheduling on identical machines, Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC'10, pp.745-754, 2010.
DOI : 10.1145/1806689.1806791
URL : http://www.nada.kth.se/~osven/papers/PCmaxFull5Nov.pdf

H. Topcuoglu, S. Hariri, and M. Y. Wu, Performance-effective and low-complexity task scheduling for heterogeneous computing, IEEE T. Parall. Distr, vol.13, issue.3, pp.260-274, 2002.
DOI : 10.1109/71.993206
URL : http://meseec.ce.rit.edu/eecc722-fall2002/papers/hc/5/l0260.pdf

H. Wang and O. Sinnen, List-scheduling vs. cluster-scheduling, IEEE T. Parall. Distr, 2018.

M. Wu and D. D. Gajski, Hypertool: A programming aid for message-passing systems, IEEE T. Parall. Distr, vol.1, issue.3, pp.330-343, 1990.
DOI : 10.1109/71.80160
URL : http://www.eece.unm.edu/~shu/lab/paper/htooltrans.pdf

T. Yang and A. Gerasoulis, DSC: Scheduling parallel tasks on an unbounded number of processors, IEEE T. Parall. Distr, vol.5, issue.9, pp.951-967, 1994.

L. Yu, V. Sarkar, and . Gt-race, Graph traversal based data race detection for asynchronous many-task runtimes, Euro-Par 2018: Parallel Processing, 2018.
DOI : 10.1007/978-3-319-96983-1_5