P. Dutot, T. N-'takpé, F. Suter, and H. Casanova, Scheduling Parallel Task Graphs on (Almost) Homogeneous Multi-cluster Platforms, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00347273

T. N-'takpé and F. Suter, Concurrent Scheduling of Parallel Task Graphs on Multi-Clusters Using Constrained Resource Allocations, Proceedings of the 10th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC- 09), 2009.

T. N-'takpé and F. Suter, Self-Constrained Resource Allocation Procedures for Parallel Task Graph Scheduling on Shared Computing Grids, Proceedings of 19th IASTED Parallel and Distributed Computing and Systems, 2007.

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

T. N-'takpé and F. Suter, Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms, Proceedings of the Twelfth International Conference on Parallel and Distributed Systems (ICPADS), 2006.

N. Tchimou and . Takpé, Algorithmes d'ordonnancement de graphes de tâchesparalì eles sur platesformes hétérogènes, In17ì eme Rencontres francophones du Parallélisme (RenPar'17), 2006.

I. Ahmad and Y. Kwok, A New Approach to Scheduling Parallel Programs Using Task Duplication, 1994 International Conference on Parallel Processing (ICPP'94), pp.47-51, 1994.
DOI : 10.1109/ICPP.1994.37

A. C. Arpaci-dusseau, D. E. Culler, and A. M. Mainwaring, Scheduling with implicit information in distributed systems, ACM SIGMETRICS Performance Evaluation Review, vol.26, issue.1, pp.233-243, 1998.
DOI : 10.1145/277858.277927

R. Bajaj and D. P. , Improving scheduling of tasks in a heterogeneous environment, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.2, pp.107-118, 2004.
DOI : 10.1109/TPDS.2004.1264795

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

J. Barbosa, C. Morais, R. Nobrega, and A. P. Monteiro, Static Scheduling of Dependant Parallel Tasks on Heterogeneous Clusters, Proceedings of the 4th International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks, pp.1-8, 2005.

O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang, Scheduling divisible loads on star and tree networks: results and open problems, IEEE Transactions on Parallel and Distributed Systems, vol.16, issue.3, pp.207-218, 2005.
DOI : 10.1109/TPDS.2005.35

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

V. Bharadwaj, T. G. Robertazzi, and D. Ghose, Scheduling Divisible Loads in Parallel and Distributed Systems, 1996.

E. Blayo, L. Debreu, G. Mounié, and D. Trystram, Dynamic Load Balancing for Ocean Circulation Model with Adaptive Meshing, Proceedings of the 5th International Euro- Par Conference on Parallel Processing(Euro-Par'99), pp.303-312, 1999.
DOI : 10.1007/3-540-48311-X_39

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

S. H. Bokhari, On the Mapping Problem, IEEE Transactions on Computers, vol.30, issue.3, pp.207-214, 1981.
DOI : 10.1109/TC.1981.1675756

R. Bolze, F. Cappello, E. Caron, M. Daydé, F. Desprez et al., Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed, International Journal of High Performance Computing Applications, vol.20, issue.4, pp.481-494, 2006.
DOI : 10.1177/1094342006070078

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

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

R. Buyya, M. Murshed, D. Abramson, and S. Venugopal, Scheduling Parameter Sweep Applications on Global Grids : a Deadline and Budget Constrained Cost-Time Optimization Algorithm. Software -Practice and Experience, pp.491-512, 2005.

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

F. Cappello, E. Caron, M. Dayde, F. Desprez, E. Jeannot et al., Grid'5000 : a Large Scale, Reconfigurable, Controlable and Monitorable Grid Platform, Proceedings of the 6th IEEE/ACM International Conference on Grid Computing (GRID 2005), pp.99-106, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000284

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

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

H. Casanova, G. Obertelli, F. Berman, and R. Wolski, The AppLeS Parameter Sweep Template : User-level middleware for the Grid, Scientific Programming, pp.111-126, 2000.

H. Casanova, D. Zagorodnov, F. Berman, and A. Legrand, Heuristics for scheduling parameter sweep applications in grid environments, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556), p.349, 2000.
DOI : 10.1109/HCW.2000.843757

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

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

S. K. Chan, V. Bharadway, and D. Ghose, Large matrix???vector products on distributed bus networks with communication delays using the divisible load paradigm: performance analysis and simulation, Mathematics and Computers in Simulation, vol.58, issue.1, pp.71-92, 2001.
DOI : 10.1016/S0378-4754(01)00329-9

H. Chen and M. Maheswaran, Distributed Dynamic Scheduling of Composite Tasks on Grid Systems [33] P. Chrétienne. Task Scheduling Over Distributed Memory Machines, Proceedings of the 12th Heterogeneous Computing Workshop Proceedings of Parallel and Distributed Algorithms, pp.165-176, 1988.

Y. Chung and S. Ranka, Applications and Performance Analysis of a Compiletime Optimization Approach for List Scheduling Algorithms on Distributed Memory Multiprocessors, Proceedings of the 1992 ACM/IEEE conference on Supercompu- ting(Supercomputing'92), pp.512-521, 1992.

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

M. Cosnard and D. Trystram, Parallel Algorithms and Architectures, 1995.
URL : https://hal.archives-ouvertes.fr/hal-00857122

F. Dahlgren and J. Torrellas, Cache-only memory architectures, Computer, vol.32, issue.6, pp.72-79, 1999.
DOI : 10.1109/2.769448

A. B. Downey, A Model For Speedup of Parallel Programs, 1997.

N. Drosinos and N. Koziris, Performance comparison of pure MPI vs hybrid MPI-OpenMP parallelization models on SMP clusters, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004.
DOI : 10.1109/IPDPS.2004.1302919

J. Du and J. Y. Leung, Complexity of Scheduling Parallel Task Systems, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.473-487, 1989.
DOI : 10.1137/0402042

P. Dutot, Hierarchical Scheduling for Moldable Tasks, Proceedings of the 11th International Euro-Par Conference (Euro-Par 2005), pp.302-311, 2005.
DOI : 10.1007/11549468_35

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

P. Dutot and D. Trystram, Scheduling on hierarchical clusters using malleable tasks, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.199-208, 2001.
DOI : 10.1145/378580.378640

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

R. A. Dutton and W. Mao, Online Scheduling of Malleable Parallel Jobs, Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems, 2007.

H. El-rewini and T. G. Lewis, Scheduling parallel program tasks onto arbitrary target machines, Journal of Parallel and Distributed Computing, vol.9, issue.2, pp.138-153, 1990.
DOI : 10.1016/0743-7315(90)90042-N

D. G. Feitelson and M. A. Jette, Improved Utilization and Responsiveness with Gang Scheduling, Proceedings of the Job Scheduling Strategies for Parallel Processing, pp.238-261, 1997.

D. G. Feitelson and L. Rudolph, Toward convergence in job schedulers for parallel supercomputers, Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, pp.1-26, 1996.
DOI : 10.1007/BFb0022284

L. Finta, Z. Liu, I. Milis, and E. Bampis, Scheduling UET-UCT series-parallel graphs on two processors, Theoretical Computer Science, vol.162, issue.2, pp.323-340, 1996.
DOI : 10.1016/0304-3975(96)00035-7

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

I. Foster and C. Kesselman, The Grid 2 : Blueprint for a New Computing Infrastructure, 2003.

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

L. R. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.
DOI : 10.1137/0117039

R. L. Henderson, Job scheduling under the Portable Batch System, Processing of the Job Scheduling Strategies for Parallel Processing, pp.279-294, 1995.
DOI : 10.1007/3-540-60153-8_34

E. S. Hou, N. Ansari, and H. Ren, A genetic algorithm for multiprocessor scheduling, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.2, pp.113-120, 1994.
DOI : 10.1109/71.265940

C. Hui and S. T. Chanson, Allocating Task Interaction Graphs to Processors in Heterogeneous Networks, IEEE Transactions on Parallel and Distributed Systems, vol.08, issue.9, pp.908-925, 1997.

S. Hunold, T. Rauber, and G. Rünger, Dynamic Scheduling of Multi-Processor Tasks on Clusters of Clusters Models and Tools for Parallel Computing on Heterogeneous Networks (Heteropar'07), Proceedings of the Sixth International Workshop on Algorithms Iverson and F. ¨ Ozgüner. Hierarchical, Competitive Scheduling of Multiple DAGs in a Dynamic Heterogeneous Environment. Distributed System Engeneering, p.112, 1999.

D. B. Jackson, Q. Snell, and M. J. Clement, Core Algorithms of the Maui Scheduler, Proceedings of the 7th International Workshop on Job Scheduling Strategies for Parallel Processing, pp.87-102, 2001.
DOI : 10.1007/3-540-45540-X_6

K. Jansen and L. Porkolab, Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks, Algorithmica, vol.32, issue.3, pp.507-520, 2002.
DOI : 10.1007/s00453-001-0085-8

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

M. D. Jones, R. Yao, and C. P. Bhole, Hybrid MPI-OpenMP Programming for Parallel OSEM PET Reconstruction, IEEE Transactions on Nuclear Science, vol.53, issue.5, pp.2752-2758, 2006.
DOI : 10.1109/TNS.2006.882295

Y. Kee, H. Casanova, and A. Chien, Realistic Modeling and Synthesis of Resources for Computational Grids, Proceedings of the Conference on High Performance Networking and Computing, 2004.

C. Kenyon and E. Rémila, Approximate strip packing, Proceedings of 37th Conference on Foundations of Computer Science, pp.31-36, 1996.
DOI : 10.1109/SFCS.1996.548461

B. Kruatrachue and T. Lewis, Grain size determination for parallel processing, IEEE Software, vol.5, issue.1, pp.23-32, 1988.
DOI : 10.1109/52.1991

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

J. K. Lenstra and D. B. Shmoys, Approximation algorithms for scheduling unrelated parallel machines, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp.259-271, 1990.
DOI : 10.1109/SFCS.1987.8

R. Lepère, G. Mounié, and D. Trystram, An approximation algorithm for scheduling trees of malleable tasks, European Journal of Operational Research, vol.142, issue.2, pp.242-249, 2002.
DOI : 10.1016/S0377-2217(02)00264-3

R. Lepère, D. Trystram, G. J. Woeginger, and D. A. Lifka, APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS, The ANL/IBM SP Scheduling System Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'95), pp.613-627, 1995.
DOI : 10.1142/S0129054102001308

W. Ludwig and P. Tiwari, Scheduling Malleable and Nonmalleable Tasks, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.167-176, 1994.

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), p.30, 1999.
DOI : 10.1109/HCW.1999.765094

L. Marchal, Y. Yang, H. Casanova, and Y. Robert, A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms, 19th IEEE International Parallel and Distributed Processing Symposium, pp.48-50, 2005.
DOI : 10.1109/IPDPS.2005.63

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

C. Mccann, R. Vaswani, and J. Zahorjan, A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors, ACM Transactions on Computer Systems, vol.11, issue.2, pp.146-178, 1993.
DOI : 10.1145/151244.151246

A. W. Mu-'alem and D. G. Feitelson, Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.6, pp.529-543, 2001.
DOI : 10.1109/71.932708

M. A. Palis, J. Liou, and D. S. Wei, Task clustering and scheduling for distributed memory parallel architectures, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.1, pp.46-55, 1996.
DOI : 10.1109/71.481597

G. Park, B. Shirazi, and J. Marquis, DFRN : A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems, Proceedings of the 11th International Symposium on Parallel Processing(IPPS'97), pp.157-166, 1997.

G. N. Prasanna and B. R. Musicus, The Optimal Control Approach to Generalized Multiprocessor Scheduling, Algorithmica, vol.15, issue.1, pp.17-49, 1996.
DOI : 10.1007/s004539900002

. Ninf, The Ninf Project

A. Radulescu, C. Nicolescu, A. J. Van-gemund, and P. P. Jonker, CPR: mixed task and data parallel scheduling for distributed systems, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, p.39, 2001.
DOI : 10.1109/IPDPS.2001.924977

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. Ramaswamy, S. Sapatnekar, and P. Banerjee, A framework for exploiting task and data parallelism on distributed memory multicomputers, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.11, pp.1098-1116, 1997.
DOI : 10.1109/71.642945

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

C. Roig, A. Ripoll, and F. Guirado, A New Task Graph Model for Mapping Message Passing Applications, IEEE Transactions on Parallel and Distributed Systems, vol.18, issue.12, pp.1740-1753, 2007.
DOI : 10.1109/TPDS.2007.1117

G. Sabin, G. Kochhar, and P. Sadayappan, Job fairness in non-preemptive job scheduling, International Conference on Parallel Processing, 2004. ICPP 2004., pp.186-194, 2004.
DOI : 10.1109/ICPP.2004.1327920

U. Schwiegelshohn and R. Yahyapour, Fairness in parallel job scheduling, Journal of Scheduling, vol.3, issue.5, pp.297-320, 2000.
DOI : 10.1002/1099-1425(200009/10)3:5<297::AID-JOS50>3.0.CO;2-D

P. Shroff, D. W. Watson, N. Flann, and R. Freund, Genetic Simulated Annealing for Scheduling Datadependent Tasks in Heterogeneous Environments, Proceedings of the 5th IEEE Heterogeneous Computing Workshop (HCW'96), pp.98-117, 1996.

H. J. Siegel, V. P. Roychowdhury, and L. Wang, A Genetic-Algorithm-Based Approach for Task Matching and Scheduling in Heterogeneous Computing Environment, Proceedings of the 5th IEEE Heterogeneous Computing Workshop (HCW'96), pp.72-85, 1996.

G. C. Sih and E. A. Lee, A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures, IEEE Transactions on Parallel and Distributed Systems, vol.4, issue.2, pp.4175-187, 1993.
DOI : 10.1109/71.207593

H. Singh and A. Youssef, Mapping and Scheduling Heterogeneous Task Graphs Using Genetic Algorithms, Proceedings of the 5th IEEE Heterogeneous Computing Workshop (HCW'96), pp.86-97, 1996.

M. Skutella, Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem, Mathematics of Operations Research, vol.23, issue.4, pp.909-929, 1998.
DOI : 10.1287/moor.23.4.909

W. Smith, V. E. Taylor, and I. T. Foster, Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance, Proceedings of the Job Scheduling Strategies for Parallel Processing (JSSPP'99), pp.202-219, 1999.
DOI : 10.1007/3-540-47954-6_11

P. Sobalvarro, S. Pakin, W. E. Weihl, and A. A. Chien, Dynamic coscheduling on workstation clusters, Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'98), pp.231-256, 1998.
DOI : 10.1007/BFb0053990

A. C. Sodan, Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey, Concurrency and Computation: Practice and Experience, vol.14, issue.15, pp.1725-1781, 2005.
DOI : 10.1002/cpe.887

F. Sourd, Scheduling Tasks on Unrelated Machines : Large Neighborhood Improvement Procedures, Journal of Heuristics, vol.7, issue.6, pp.519-531, 2001.
DOI : 10.1023/A:1011960407575

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

A. Steinberg, A Strip-Packing Algorithm with Absolute Performance Bound 2, SIAM Journal on Computing, vol.26, issue.2, pp.401-409, 1997.
DOI : 10.1137/S0097539793255801

V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969.
DOI : 10.1007/BF02165411

F. Suter, Parallélisme mixte et prédiction de performances sur réseaux hétérogènes de machinesparalì eles, 2002.

F. Suter, Scheduling &#x0394;-Critical Tasks in mixed-parallel applications on a national grid, 2007 8th IEEE/ACM International Conference on Grid Computing, 2007.
DOI : 10.1109/GRID.2007.4354109

F. Suter and H. Casanova, Extracting Synthetic Multi-Cluster Platform Configurations from Grid'5000 for Driving Simulation Experiments, p.112
URL : https://hal.archives-ouvertes.fr/inria-00166181

Y. Tanaka, H. Nakada, S. Sekiguchi, T. Suzumura, and S. Matsuoka, Ninf-G : A Reference Implementation of RPC-based Programming Middleware for Grid Computing, Journal of Grid Computing, vol.1, issue.1, pp.41-51, 2003.
DOI : 10.1023/A:1024083511032

T. Bluegene and /. Team, An overview of the BlueGene/L Supercomputer, Proceedings of the 2002 ACM/IEEE conference on Supercomputing (Supercomputing'02), pp.1-22, 2002.

G. Tessier, J. Roman, and G. Latu, Hybrid MPI-Thread Implementation on a Cluster of SMP Nodes of a Parallel Simulator for the Propagation of Powdery Mildew in a Vineyard, Proceedings of the Second International Conference on High Performance Computing and Communications, pp.833-842, 2006.
DOI : 10.1007/11847366_86

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

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

K. Van-der-raadt, Y. Yang, and H. Casanova, Practical Divisible Load Scheduling on Grid Platforms with APST-DV, 19th IEEE International Parallel and Distributed Processing Symposium, 2005.
DOI : 10.1109/IPDPS.2005.351

M. Vanhoucke and D. Debels, The discrete time/cost trade-off problem: extensions and heuristic procedures, Journal of Scheduling, vol.120, issue.2, pp.4-5, 2007.
DOI : 10.1007/s10951-007-0031-y

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

M. Y. 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

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. Yang and H. Casanova, RUMR: robust scheduling for divisible workloads, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on, pp.114-125, 2003.
DOI : 10.1109/HPDC.2003.1210021

Y. Yang and H. Casanova, UMR: a multi-round algorithm for scheduling divisible workloads, Proceedings International Parallel and Distributed Processing Symposium, pp.24-32, 2003.
DOI : 10.1109/IPDPS.2003.1213101

H. Zhao and R. Sakellariou, Scheduling Multiple DAGs onto Heterogeneous Systems, Proceedings of the 15th Heterogeneous Computing Workshop Island of Rhodes, 2006.

T. A. Glossaire, Aire moyenne (occupée dans le diagramme de Gantt représentant l'ordonnancement)

. Grappe, Ensemble d'ordinateurs (appelés noeuds) reliés entre eux au sein d'un réseau local (typiquementàtypiquement`typiquementà l'intérieur d'une même salle machine)

. Grille, Agrégation hétérogène de ressources informatiques reparties sur des sites géographiquement distants, partagées par de nombreux utilisateurs et administrées de manì ere décentralisée en

. Heuristique, Algorithme qui fournit rapidement (en temps polynomial) une solution réalisable, pas nécessairement optimale, pour unprobì eme d'optimisation NP-difficile