U. A. Acar, G. E. Blelloch, and R. D. Blumofe, The data locality of work stealing, Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, pp.1-12, 2000.

J. Alber and R. Niedermeier, On Multidimensional Curves with Hilbert Property, Theory of Computing Systems, pp.295-312, 2000.
DOI : 10.1007/s002240010003

N. S. Arora, R. D. Blumofe, and C. G. Plaxton, Thread scheduling for multiprogrammed multiprocessors, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, pp.119-129, 1998.
DOI : 10.1007/s00224-001-0004-z

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. A. Bender and M. O. And-rabin, Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk, Theory of Computing Systems Special Issue on SPAA, pp.289-304, 2002.
DOI : 10.1007/s00224-002-1055-5

R. D. Blumofe and C. Leiserson, Scheduling multithreaded computations by work stealing, Proceedings., 35th Annual Symposium on, pp.356-368, 1994.
DOI : 10.1109/sfcs.1994.365680

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. R. Butz, Alternative Algorithm for Hilbert's Space-Filling Curve. Computers, pp.424-426, 1971.
DOI : 10.1109/t-c.1971.223258

D. Cordeiro, The impact of cooperation on new high performance computing platforms, p.12, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00690908

D. E. Culler, R. M. Karp, D. Patterson, A. Sahay, E. E. Santos et al., LogP : towards a realistic model of parallel computation, SIGPLAN Not, vol.28, pp.7-8, 1993.

D. E. Culler, R. M. Karp, D. Patterson, A. Sahay, E. E. Santos et al., LogP: a practical model of parallel computation, Communications of the ACM, vol.39, issue.11, pp.78-85, 1996.
DOI : 10.1145/240455.240477

T. Gautier, X. Besseron, P. , and L. , KAAPI, Proceedings of the 2007 international workshop on Parallel symbolic computation, PASCO '07, pp.15-23, 2007.
DOI : 10.1145/1278177.1278182

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

T. Gautier, J. V. Ferreira-lima, N. Maillard, and B. And-raffin, XKaapi: A Runtime System for Data-Flow Task Programming on Heterogeneous Architectures, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, 2013.
DOI : 10.1109/IPDPS.2013.66

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

T. Gautier, J. V. Lima, N. Maillard, and B. And-raffin, Locality-Aware Work Stealing on Multi-CPU and Multi-GPU Architectures, 6th Workshop on Programmability Issues for Heterogeneous Multicores (MULTIPROG) (2013). (cf, pp.3-8
URL : https://hal.archives-ouvertes.fr/hal-00780890

T. Gautier, J. Roch, and F. Wagner, Fine Grain Distributed Implementation of a Dataflow Language with Provable Performances, In Computational Science ? ICCS Lecture Notes in Computer Science, vol.4488, pp.593-600, 2007.
DOI : 10.1007/978-3-540-72586-2_87

R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.
DOI : 10.1002/j.1538-7305.1966.tb01709.x

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

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

J. Hungershöfer and J. Wierum, On the Quality of Partitions Based on Space-Filling Curves, Computational Science?ICCS, pp.36-45, 2002.
DOI : 10.1007/3-540-47789-6_4

E. Jeannot, E. Saule, and D. Trystram, Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines, Lecture Notes in Computer Science, vol.5168, issue.14, pp.877-886, 2008.
DOI : 10.1007/978-3-540-85451-7_94

URL : https://hal.archives-ouvertes.fr/inria-00333906

S. Kedad-sidhoum, F. Monna, G. Mounié, and D. Trystram, Scheduling Independent Tasks on Multi-cores with GPU Accelerators, pp.7-15, 2013.
DOI : 10.1007/978-3-642-54420-0_23

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

P. Kovatch, M. Ezell, R. M. Braby, P. D. Alexander, A. Ambra et al., The Malthusian Catastrophe Is Upon Us! Are the Largest HPC Machines Ever Up?, Euro-Par 2011 : Parallel Processing Workshops, pp.211-220
DOI : 10.1007/978-3-642-29740-3_25

A. Narang, A. Srivastava, N. Kumar, and R. Shyamasundar, Affinity Driven Distributed Scheduling Algorithm for Parallel Computations, Lecture Notes in Computer Science, vol.6522, pp.167-178
DOI : 10.1007/978-3-642-17679-1_15

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

G. J. Narlikar, Scheduling Threads for Low Space Requirement and Good Locality, Theory of Computing Systems, vol.35, issue.2, pp.151-187, 2002.
DOI : 10.1007/s00224-001-1030-6

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. H. Papadimitriou, Y. , and M. , On the approximability of tradeoffs and optimal access of web sources, Foundations of Computer Science Proceedings. 41st Annual Symposium on, pp.86-92, 2000.

J. Quintin and F. Wagner, Hierarchical Work-Stealing, Euro-Par 2010 -Parallel Processing
DOI : 10.1007/978-3-642-15277-1_21

URL : https://hal.archives-ouvertes.fr/inria-00429624

Y. Robert, V. , and F. , Introduction to scheduling. Chapman & Hall/CRC Computational Science, pp.3-4, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00786389

H. Sagan, Space-Filling Curves. Universitext, 1994.

D. B. Shmoys, T. , and E. , Scheduling unrelated machines with costs, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms SODA '93, pp.448-454, 1993.

D. B. Shmoys, J. Wein, and D. P. Williamson, Scheduling Parallel Machines On-Line, SIAM Journal on Computing, vol.24, issue.6, pp.1313-1331, 1995.
DOI : 10.1137/S0097539793248317

C. Stein and J. And-wein, On the existence of schedules that are near-optimal for both makespan and total weighted completion time, Operations Research Letters, vol.21, issue.3, pp.115-122, 1997.
DOI : 10.1016/S0167-6377(97)00025-4

M. Tchiboukdjian, V. Danjean, and B. And-raffin, Binary Mesh Partitioning for Cache-Efficient Visualization, IEEE Transactions on Visualization and Computer Graphics, vol.16, issue.5, pp.815-843, 2010.
DOI : 10.1109/TVCG.2010.19

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

M. Tchiboukdjian, N. Gast, D. Trystram, J. L. Roch, and J. Bernard, A Tighter Analysis of Work Stealing, International Symposium on Algorithms and Computation (ISAAC), pp.291-302, 2010.
DOI : 10.1007/978-3-642-17514-5_25

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

H. Topcuoglu, S. Hariri, and M. Wu, Task scheduling algorithms for heterogeneous processors, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99), pp.3-14, 1999.
DOI : 10.1109/HCW.1999.765092

J. D. Ullman, NP-complete scheduling problems, Journal of Computer and System Sciences, vol.10, issue.3, pp.384-393, 1975.
DOI : 10.1016/S0022-0000(75)80008-0

URL : http://doi.org/10.1016/s0022-0000(75)80008-0