W. Allcock, J. Bester, J. Bresnahan, A. Chervenak, L. Liming et al., GridFTP: Protocol Extension to FTP for the Grid, Grid Forum Internet-Draft, 2001.

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and Approximation, 1999.

H. Bal and M. Haines, Approaches for integrating task and data parallelism, IEEE Concurrency, vol.6, issue.3, pp.74-84, 1998.

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

G. D. Barlas, Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees, IEEE Trans. Parallel Distributed Systems, vol.9, issue.5, pp.429-441, 1998.

S. Bataineh, T. Y. Hsiung, and T. G. Robertazzi, Closed form solutions for bus and tree networks of processors load sharing a divisible job, IEEE Transactions on computers, vol.43, issue.10, pp.1184-1196, 1994.

O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang, Scheduling divisible loads for star and tree networks: main results and open problems, 2003.

O. Beaumont, A. Legrand, and Y. Robert, Scheduling divisible workloads on heterogeneous platforms, Parallel Computing, vol.29, pp.1121-1152, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00789431

M. Berkelaar, . Lp, and . Solve,

F. Berman, G. Fox, and T. Hey, Grid Computing: Making the Global Infrastructure a Reality, 2003.

D. Bertsekas and R. Gallager, Data Networks, 1987.

D. Bertsimas and D. Gamarnik, Asymptotically optimal algorithm for job shop scheduling and packet routing, Journal of Algorithms, vol.33, issue.2, pp.296-318, 1999.

M. D. Beynon, T. Kurc, A. Sussman, and J. Saltz, Optimizing execution of component-based applications using group instances, Future Generation Computer Systems, vol.18, issue.4, pp.435-448, 2002.

V. Bharadwaj and G. Barlas, Efficient scheduling strategies for processing multiple divisible loads on bus networks, J. Parallel and Distributed Computing, vol.62, pp.132-151, 2002.

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

V. Bharadwaj, D. Ghose, and T. G. Robertazzi, Divisible load theory: a new paradigm for load scheduling in distributed systems, Cluster Computing, vol.6, issue.1, pp.7-17, 2003.

T. D. Braun, H. J. Siegel, and N. Beck, Optimal use of mixed task and data parallelism for pipelined computations, J. Parallel and Distributed Computing, vol.61, pp.810-837, 2001.

, CDF Analysis Farms (CAF

H. Casanova, Modeling Large-Scale Platforms for the Analysis and the Simulation of Scheduling Strategies, Proceedings of the 6th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), 2004.

S. Chakrabarti, J. Demmel, and K. Yelick, Models and scheduling algorithms for mixed data and task parallel programs, J. Parallel and Distributed Computing, vol.47, pp.168-184, 1997.

D. Coudert and H. Rivano, Lightpath assignment for multifibers WDM optical networks with wavelength translators, IEEE Global Telecommunications Conference, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072101

, The Grid: Blueprint for a New Computing Infrastructure, 1999.

, Computational Grids: Blueprint for a New Computing Infrastructure. M, 2003.

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

D. Ghose and T. G. Robertazzi, Special issue on Divisible Load Scheduling. Cluster Computing, 2003.

D. Hochbaum, Approximation Algorithms for NP-hard Problems, 1997.

A. Legrand, L. Marchal, and H. Casanova, Scheduling Distributed Applications: The SimGrid Simulation Framework, Proceedings of the Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid'03), 2003.
URL : https://hal.archives-ouvertes.fr/hal-00789451

S. Ramaswamy, S. Sapatnekar, and P. Banerjee, A framework for exploiting task and data parallelism on distributed memory multicomputers, IEEE Trans. Parallel and Distributed Systems, vol.8, issue.11, pp.1098-1116, 1997.

T. G. Robertazzi, Divisible Load Scheduling

T. G. Robertazzi, Processor equivalence for a linear daisy chain of load sharing processors, IEEE Trans. Aerospace and Electronic Systems, vol.29, pp.1216-1221, 1993.

T. G. Robertazzi, Ten reasons to use divisible load theory, IEEE Computer, vol.36, issue.5, pp.63-68, 2003.

M. Spencer, R. Ferreira, M. Beynon, T. Kurc, U. Catalyurek et al., Executing multiple pipelined data analysis operations in the grid, 2002 ACM/IEEE Supercomputing Conference, 2002.

J. Subhlok and G. Vondran, Optimal use of mixed task and data parallelism for pipelined computations, J. Parallel and Distributed Computing, vol.60, pp.297-319, 2000.

H. M. Wong, D. Yu, V. Bharadwaj, and T. G. Robertazzi, Data intensive grid scheduling: multiple sources with capacity constraints, PDCS'2003, 15th Int'l Conf. Parallel and Distributed Computing and Systems, 2003.

D. Yu and T. G. Robertazzi, Divisible load scheduling for grid computing, PDCS'2003, 15th Int'l Conf. Parallel and Distributed Computing and Systems. IASTED Press, 2003. INRIA Unité de recherche INRIA

. Unité-de-recherche-inria-futurs, Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex

. Unité-de-recherche-inria-lorraine, LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602