G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and Approximation, 1999.
DOI : 10.1007/978-3-642-58412-1

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

H. Aydin, R. Melhem, D. Mosse, and P. M. Alvarez, Power-aware scheduling for periodic real-time tasks, IEEE Transactions on Computers, vol.53, issue.5, pp.584-600, 2004.
DOI : 10.1109/TC.2004.1275298

O. Beaumont, V. Boudet, and Y. Robert, A realistic model and an efficient heuristic for scheduling with heterogeneous processors, Proceedings 16th International Parallel and Distributed Processing Symposium, 2002.
DOI : 10.1109/IPDPS.2002.1015663

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

O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Assessing the Impact and Limits of Steady-State Scheduling for Mixed Task and Data Parallelism on Heterogeneous Platforms, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks, pp.296-302, 2004.
DOI : 10.1109/ISPDC.2004.12

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

A. Benoit, M. Cole, S. Gilmore, and J. Hillston, Evaluating the performance of pipelinestructured parallel programs with skeletons and process algebra. Scalable Computing: Practice and Experience, pp.1-16, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00807016

A. Benoit, M. Cole, S. Gilmore, and J. Hillston, Scheduling skeleton-based grid applications using PEPA and NWS. The Computer Journal, Special issue on Grid Performability Modelling and Measurement, pp.369-378, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00807023

M. Beynon, A. Sussman, U. Catalyurek, T. Kurc, and J. Saltz, Performance optimization for data intensive grid applications, Proceedings Third Annual International Workshop on Active Middleware Services, 2001.
DOI : 10.1109/AMS.2001.993725

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.
DOI : 10.1016/S0167-739X(01)00070-X

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

S. H. Bokhari, Partitioning problems in parallel, pipeline, and distributed computing, IEEE Transactions on Computers, vol.37, issue.1, pp.48-57, 1988.
DOI : 10.1109/12.75137

M. Cole, Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming, Parallel Computing, vol.30, issue.3, pp.389-406, 2004.
DOI : 10.1016/j.parco.2003.12.002

P. Crescenzi and V. Kann, A compendium of NP optimization problems. World Wide Web document

D. Project, Middleware for Filtering Large Archival Scientific Datasets in a Grid Environment

E. Fabiani and D. Lavenier, Placement of Linear Arrays, 10th International Conference on Field Programmable Logic and Applications, 2000.
DOI : 10.1007/3-540-44614-1_101

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

P. Hansen and K. Lih, Improved algorithms for partitioning problems in parallel, pipeline, and distributed computing, IEEE Trans. Computers, issue.6, pp.41769-771, 1992.

L. Hollermann, T. S. Hsu, D. R. Lopez, and K. Vertanen, Scheduling problems in a practical allocation model, Journal of Combinatorial Optimization, vol.1, issue.2, pp.129-149, 1997.
DOI : 10.1023/A:1009799631608

T. S. Hsu, J. C. Lee, D. R. Lopez, and W. A. Royce, Task allocation on a network of processors, IEEE Trans. Computers, issue.12, pp.491339-1353, 2000.

M. A. Iqbal and S. H. Bokhari, Efficient algorithms for a class of partitioning problems, IEEE Transactions on Parallel and Distributed Systems, vol.6, issue.2, pp.170-175, 1995.
DOI : 10.1109/71.342129

S. L. Johnsson and C. Ho, Optimum broadcasting and personalized communication in hypercubes, IEEE Transactions on Computers, vol.38, issue.9, pp.1249-1268, 1989.
DOI : 10.1109/12.29465

D. W. Krumme, G. Cybenko, and K. N. Venkataraman, Gossiping in Minimal Time, SIAM Journal on Computing, vol.21, issue.1, pp.111-139, 1992.
DOI : 10.1137/0221010

M. Maheswaran and H. J. Siegel, A dynamic matching and scheduling algorithm for heterogeneous computing systems, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98), 1998.
DOI : 10.1109/HCW.1998.666545

B. Olstad and F. Manne, Efficient partitioning of sequences, IEEE Transactions on Computers, vol.44, issue.11, pp.1322-1326, 1995.
DOI : 10.1109/12.475128

A. Pinar and C. Aykanat, Fast optimal load balancing algorithms for 1D partitioning, Journal of Parallel and Distributed Computing, vol.64, issue.8, pp.974-996, 2004.
DOI : 10.1016/j.jpdc.2004.05.003

F. Rabhi and S. Gorlatch, Patterns and Skeletons for Parallel and Distributed Computing, 2002.
DOI : 10.1007/978-1-4471-0097-3

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

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, Comparison of contention aware list scheduling heuristics for cluster computing, Proceedings International Conference on Parallel Processing Workshops, pp.382-387, 2001.
DOI : 10.1109/ICPPW.2001.951976

M. Spencer, R. Ferreira, M. Beynon, T. Kurc, U. Catalyurek et al., Executing Multiple Pipelined Data Analysis Operations in the Grid, ACM/IEEE SC 2002 Conference (SC'02), 2002.
DOI : 10.1109/SC.2002.10015

J. Subhlok and G. Vondran, Optimal mapping of sequences of data parallel tasks, Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'95, pp.134-143, 1995.

J. Subhlok and G. Vondran, Optimal latency-throughput tradeoffs for data parallel pipelines, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures , SPAA '96, pp.62-71, 1996.
DOI : 10.1145/237502.237508

K. Taura and A. A. Chien, A heuristic algorithm for mapping communicating tasks on heterogeneous resources, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556), pp.102-115, 2000.
DOI : 10.1109/HCW.2000.843736

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

D. Zhu, R. Melhem, and B. Childers, Power-aware scheduling for multi-processor real-time systems, IEEE Trans. Parallel Distributed Systems, vol.14, issue.7, pp.686-700, 2003.