M. Adler, Y. Gong, and A. L. Rosenberg, Optimal sharing of bags of tasks in heterogeneous clusters, 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA'03), pp.1-10, 2003.

H. Casanova and F. Berman, Parameter sweeps on the grid with APST, Grid Computing: making the global infrastructure a reality, 2003.

, BOINC: Berkeley Open Infrastructure for Network Computing

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

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

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

P. Brucker, Scheduling Algorithms, 2004.

H. Topcuoglu, S. Hariri, and M. Wu, Performance-effective and lowcomplexity task scheduling for heterogeneous computing, IEEE Trans. Parallel and Distributed Systems, vol.13, issue.3, pp.260-274, 2002.

B. Hong and V. Prasanna, Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput, IPDPS, 2004.

P. Bhat, C. Raghavendra, and V. Prasanna, Efficient collective communication in distributed heterogeneous systems, ICDCS'99, pp.15-24, 1999.

, Efficient collective communication in distributed heterogeneous systems, Journal of Parallel and Distributed Computing, vol.63, issue.3, pp.251-263, 2003.

T. Saif and M. Parashar, Understanding the behavior and performance of non-blocking communications in MPI, Proc. of Euro-Par 2004: Parallel Processing, ser. LNCS 3149, pp.173-182, 2004.

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.

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.

O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, Bandwidth-centric allocation of independent tasks on heterogeneous platforms, Proceedings of IPDPS'2002, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072412

M. A. Bender, S. Chakrabarti, and S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, Proceedings of SODA'98. SIAM, pp.270-279, 1998.

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

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.
URL : https://hal.archives-ouvertes.fr/inria-00565004

O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal et al., Centralized versus distributed schedulers for multiple bagof-task applications, IEEE Trans. Parallel Distributed Systems, vol.19, issue.5, pp.698-709, 2008.

, GNU Linear Programming Kit

A. Legrand, L. Marchal, and H. Casanova, Scheduling Distributed Applications: The SIMGRID Simulation Framework, Proceedings of CCGrid'03, pp.138-145, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00789451

W. Gropp, MPICH2: A new start for MPI implementations, Euro PVM/MPI, ser. LNCS, vol.2474, pp.37-42, 2002.

D. G. Feitelson, Workload Characterization and Modeling Book

U. Seti,

W. Cirne, D. Paranhos, L. Costa, E. Santos-neto, F. Brasileiro et al., Running Bag-ofTasks Applications on Computational Grids: The MyGrid Approach, Proceedings of ICCP'2003, 2003.

F. Berman, R. Wolski, H. Casanova, W. Cirne, H. Dail et al., Adaptive computing on the grid using AppLeS, IEEE Trans. Parallel Distributed Systems, vol.14, issue.4, pp.369-382, 2003.

M. Litzkow, M. Livny, and M. W. Mutka, Condor-A hunter of idle workstations, Proceedings of the 8th International Conference of Distributed Computing Systems, pp.104-111, 1988.

F. A. Silva, S. Carvalho, and E. R. Hruschka, A scheduling algorithm for running bag-of-tasks data mining applications on the grid, EuroPar 2004 Parallel Processing, ser. LNCS, vol.3149, pp.254-262, 2004.

C. Weng and X. Lu, Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid, Future Generation Computer Systems, vol.21, issue.1, pp.271-280, 2005.

A. Sulistio and R. Buyya, A time optimization algorithm for scheduling bag-of-task applications in auction-based proportional share systems, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2005, pp.235-242, 2005.

C. Anglano and M. Canonico, Scheduling algorithms for multiple bagof-task applications on desktop grids: A knowledge-free approach, 2nd International Workshop on Desktop Grids and Volunteer Computing Systems (PCGRID 08), 2008.

P. Chrétienne and E. G. Coffman, Scheduling Theory and its Applications, 1995.

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.

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Steady-state scheduling on heterogeneous clusters, Int. J. of Foundations of Computer Science, vol.16, issue.2, pp.163-194, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00358951

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

A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of divisible requests, Journal of Scheduling, vol.11, issue.5, pp.381-404, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02102657

M. A. Bender, S. Muthukrishnan, and R. Rajaraman, Approximation algorithms for average stretch scheduling, J. of Scheduling, vol.7, issue.3, pp.195-222, 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, pp.297-305, 2002.

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.

O. Sinnen and L. Sousa, Communication contention in task scheduling, IEEE Trans. Parallel Distributed Systems, vol.16, issue.6, pp.503-515, 2004.