M. Adler, Y. Gong, and A. L. Rosenberg, Optimal sharing of bags of tasks in heterogeneous clusters, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '03, pp.1-10, 2003.
DOI : 10.1145/777412.777414

S. Albers, On randomized online scheduling, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.134-143, 2002.
DOI : 10.1145/509907.509930
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.613

S. Albers, Online algorithms: a survey, Mathematical Programming, vol.97, issue.1, pp.3-26, 2003.
DOI : 10.1007/s10107-003-0436-0

K. Baker, Introduction to Sequencing and Scheduling, 1974.

C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand et al., Scheduling strategies for master-slave tasking on heterogeneous processor platforms, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.4, pp.319-330, 2004.
DOI : 10.1109/TPDS.2004.1271181
URL : https://hal.archives-ouvertes.fr/hal-00789427

O. Beaumont, V. Boudet, A. Petitet, F. Rastello, and Y. Robert, A proposal for a heterogeneous cluster ScaLAPACK (dense linear solvers), IEEE Transactions on Computers, vol.50, issue.10, pp.501052-1070, 2001.
DOI : 10.1109/12.956091
URL : https://hal.archives-ouvertes.fr/hal-00808287

O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal et al., Centralized versus distributed schedulers for multiple bag-of-task applications, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639262

O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, Bandwidth-centric allocation of independent tasks on heterogeneous platforms, Proceedings 16th International Parallel and Distributed Processing Symposium, 2002.
DOI : 10.1109/IPDPS.2002.1015568
URL : https://hal.archives-ouvertes.fr/inria-00072412

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Independent and divisible tasks scheduling on heterogeneous star-schaped platforms with limited memory, PDP'2005, 13th Euromicro Workshop on Parallel, Distributed and Network-based Processing, pp.179-186, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00789442

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, STEADY-STATE SCHEDULING ON HETEROGENEOUS CLUSTERS, International Journal of Foundations of Computer Science, vol.16, issue.02, pp.163-194, 2005.
DOI : 10.1142/S0129054105002930
URL : https://hal.archives-ouvertes.fr/inria-00358951

M. A. Bender, S. Chakrabarti, and S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, Proceedings of the 9th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA'98), pp.270-279, 1998.

M. A. Bender, S. Muthukrishnan, and R. Rajaraman, Approximation Algorithms for Average Stretch Scheduling, Journal of Scheduling, vol.7, issue.3, pp.195-222, 2004.
DOI : 10.1023/B:JOSH.0000019681.52701.8b

F. Berman, R. Wolski, H. Casanova, W. Cirne, H. Dail et al., Adaptive computing on the grid using AppLeS, IEEE Transactions on Parallel and Distributed Systems, vol.14, issue.4, pp.369-382, 2003.
DOI : 10.1109/TPDS.2003.1195409

D. Bertsimas and D. Gamarnik, Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing, Journal of Algorithms, vol.33, issue.2, pp.296-318, 1999.
DOI : 10.1006/jagm.1999.1047
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8920

P. Bhat, C. Raghavendra, and V. Prasanna, Efficient collective communication in distributed heterogeneous systems, ICDCS'99 19th International Conference on Distributed Computing Systems, pp.15-24, 1999.

P. Bhat, C. Raghavendra, and V. Prasanna, Efficient collective communication in distributed heterogeneous systems, Journal of Parallel and Distributed Computing, vol.63, issue.3, pp.251-263, 2003.
DOI : 10.1016/S0743-7315(03)00008-X

P. Boulet, J. Dongarra, Y. Robert, and F. Vivien, Static tiling for heterogeneous computing platforms, Parallel Computing, vol.25, issue.5, pp.547-568, 1999.
DOI : 10.1016/S0167-8191(99)00012-5
URL : https://hal.archives-ouvertes.fr/inria-00565004

P. Brucker, Scheduling Algorithms, 2004.

C. Chekuri and S. Khanna, Approximation schemes for preemptive weighted flow time, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.297-305, 2002.
DOI : 10.1145/509907.509954
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.9354

W. Cirne, D. Paranhos, L. Costa, E. Santos-neto, F. Brasileiro et al., Running Bag-of-Tasks applications on computational grids: the MyGrid approach, 2003 International Conference on Parallel Processing, 2003. Proceedings., 2003.
DOI : 10.1109/ICPP.2003.1240605

J. Cowie, B. Dodson, R. Elkenbracht-huizing, A. K. Lenstra, P. L. Montgomery et al., A World Wide Number Field Sieve factoring record: On to 512 bits, Advances in Cryptology -Asiacrypt '96, pp.382-394, 1996.
DOI : 10.1007/BFb0034863

D. G. Feitelson, Workload Characterization and Modeling Book. electronic draft, no published yet

J. Frey, T. Tannenbaum, I. Foster, M. Livny, and S. Tuecke, Condor-G: a computation management agent for multi-institutional grids, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing, 2001.
DOI : 10.1109/HPDC.2001.945176

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

W. Gropp, MPICH2: A New Start for MPI Implementations, PVM/MPI, 2002.
DOI : 10.1007/3-540-45825-5_5

W. Gropp, E. Lusk, N. Doss, and A. Skjellum, A high-performance, portable implementation of the MPI message passing interface standard, Parallel Computing, vol.22, issue.6, pp.789-828, 1996.
DOI : 10.1016/0167-8191(96)00024-5

B. Hong and V. Prasanna, Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004.
DOI : 10.1109/IPDPS.2004.1302974

N. T. Karonis, B. Toonen, and I. Foster, MPICH-G2: A Grid-enabled implementation of the Message Passing Interface, Journal of Parallel and Distributed Computing, vol.63, issue.5, pp.551-563, 2003.
DOI : 10.1016/S0743-7315(03)00002-9

B. Kreaseck, Dynamic autonomous scheduling on Heterogeneous Systems, 2003.

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

A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of biological requests, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '06, pp.103-112, 2006.
DOI : 10.1145/1148109.1148124
URL : https://hal.archives-ouvertes.fr/inria-00070293

A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of divisible requests, Journal of Scheduling, vol.3, issue.1, 2006.
DOI : 10.1007/s10951-008-0078-4
URL : https://hal.archives-ouvertes.fr/inria-00108524

M. Litzkow, M. Livny, and M. W. Mutka, Condor-a hunter of idle workstations, [1988] Proceedings. The 8th International Conference on Distributed, pp.104-111, 1988.
DOI : 10.1109/DCS.1988.12507

S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. Gehrke, Online scheduling to minimize average stretch, IEEE Symposium on Foundations of Computer Science, pp.433-442, 1999.

J. Pineau, Y. Robert, F. Vivien, and J. Dongarra, Matrix product on heterogeneous master-worker platforms, 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00803487

K. Pruhs, J. Sgall, and E. Torng, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter Online Scheduling, 2004.

T. Saif and M. Parashar, Understanding the Behavior and Performance of Non-blocking Communications in MPI, Proceedings of Euro-Par 2004: Parallel Processing, pp.173-182, 2004.
DOI : 10.1007/978-3-540-27866-5_22

A. S. Schulz and M. Skutella, The power of?-points in preemptive single machine scheduling, Journal of Scheduling, vol.32, issue.2, pp.121-133, 2002.
DOI : 10.1002/jos.93

B. A. Shirazi, A. R. Hurson, and K. M. Kavi, Scheduling and load balancing in parallel and distributed systems, 1995.

O. Sinnen and L. Sousa, Communication contention in task scheduling, IEEE Transactions on Parallel and Distributed Systems, vol.16, issue.6, pp.503-515, 2004.
DOI : 10.1109/TPDS.2005.64

W. E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly, vol.2, issue.1-2, pp.59-66, 1956.
DOI : 10.1002/nav.3800030106

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

I. Unité-de-recherche and . Rhône, Alpes 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004.

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399