R. D. Blumofe and C. E. Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM, vol.46, issue.5, pp.720-748, 1999.
DOI : 10.1145/324133.324234
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7695

H. J. Hoogeveen, J. K. Lenstra, and B. Veltman, Three, four, five, six, or the complexity of scheduling with communication delays, Operations Research Letters, vol.16, issue.3, pp.129-137, 1994.
DOI : 10.1016/0167-6377(94)90024-8

V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, 1989.

M. Wu and D. D. Gajski, Hypertool: a programming aid for message-passing systems, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.3, pp.330-343, 1990.
DOI : 10.1109/71.80160
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9185

Y. Kwok and I. Ahmad, Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.5, pp.506-521, 1996.
DOI : 10.1109/71.503776

G. C. Sih and E. A. Lee, Dynamic-level scheduling for heterogeneous processor networks, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990, pp.42-49, 1990.
DOI : 10.1109/SPDP.1990.143505

T. Yang and A. Gerasoulis, DSC: scheduling parallel tasks on an unbounded number of processors, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.9, pp.951-967, 1994.
DOI : 10.1109/71.308533

Y. Tao and G. Apostolos, Pyrros: static task scheduling and code generation for message passing multiprocessors, Proceedings of the 6th international conference on Supercomputing , ser. ICS '92, pp.428-437, 1992.

R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.
DOI : 10.1137/0117039
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.8131

H. Topcuouglu, 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

H. Oh and S. Ha, A static scheduling heuristic for heterogeneous processors, Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II, ser. Euro-Par '96, pp.573-577, 1996.
DOI : 10.1007/BFb0024750
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.6178

M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99), 1999.
DOI : 10.1109/HCW.1999.765094

S. Rizos and Z. Henan, A hybrid heuristic for dag scheduling on heterogeneous systems, Parallel and Distributed Processing Symposium Proceedings. 18th International, 2004.

N. S. Arora, R. D. Blumofe, and C. G. Plaxton, Thread Scheduling for Multiprogrammed Multiprocessors, Theory of Computing Systems, vol.34, issue.2, pp.115-144, 2001.
DOI : 10.1007/s00224-001-0004-z
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.3853

J. Dinan, D. B. Larkins, P. Sadayappan, S. Krishnamoorthy, and J. Nieplocha, Scalable work stealing Storage and Analysis, ser. SC '09, Proceedings of the Conference on High Performance Computing Networking, 2009.
DOI : 10.1145/1654059.1654113

N. Gast and B. Gaujal, A mean field model of work stealing in large-scale systems, ACM sigmetrics, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00788862

A. Shivali, B. Rajkishore, B. Dan, S. Vivek, S. R. et al., Deadlock-free scheduling of x10 computations with bounded resources, SPAA, 2007.

M. Frigo, C. E. Leiserson, and K. H. Randall, The implementation of the Cilk-5 multithreaded lan guage, ACM SIGPLAN, pp.212-223, 1998.

T. Gautier, X. Besseron, and L. Pigeon, KAAPI, Proceedings of the 2007 international workshop on Parallel symbolic computation, PASCO '07, 2007.
DOI : 10.1145/1278177.1278182
URL : https://hal.archives-ouvertes.fr/hal-00647474

R. Van-nieuwpoort, J. Maassen, R. Hofman, T. Kielmann, and H. E. Bal, Satin, ACM Transactions on Programming Languages and Systems, vol.32, issue.3, 2003.
DOI : 10.1145/1709093.1709096

A. Robison, M. Voss, and A. Kukanov, Optimization via Reflection on Work Stealing in TBB, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-8, 2008.
DOI : 10.1109/IPDPS.2008.4536188

J. K. Lee and J. Palsberg, Featherweight x10: A core calculus for async-finish parallelism, PPoPP, 2010.

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

D. Cordeiro, G. Mounié, S. Perarnau, D. Trystram, J. Vincent et al., Random graph generation for scheduling simulations, Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, 2010.
DOI : 10.4108/ICST.SIMUTOOLS2010.8667
URL : https://hal.archives-ouvertes.fr/hal-00471255

R. P. Dick, D. L. Rhodes, and W. Wolf, TGFF, Proceedings of the sixth international workshop on Hardware/software codesign , CODES/CASHE '98, pp.97-101, 1998.
DOI : 10.1145/278241.278309

T. Tobita and H. Kasahara, A standard task graph set for fair evaluation of multiprocessor scheduling algorithms, Journal of Scheduling, vol.70, issue.5, pp.379-394, 2002.
DOI : 10.1002/jos.116