F. Afrati, E. Bampis, A. V. Fishkin, K. Jansen, and C. Kenyon, Scheduling to Minimize the Average Completion Time of Dedicated Tasks, Lecture Notes in Computer Science, 1974.
DOI : 10.1007/3-540-44450-5_37

E. Bampis, A. Giannakos, and J. König, On the complexity of scheduling with large communication delays, European Journal of Operational Research, vol.94, issue.2, pp.252-260, 1996.
DOI : 10.1016/0377-2217(96)00124-5

J. Bb-la?-zewicz, E. Klaus, B. Plateau, and D. Trystram, Handbook on parallel and distributed processing. International handbooks on information systems, 2000.

J. Bb-la?-zewicz, M. Machowiak, G. Mounié, and D. Trystram, Approximation algorithms for scheduling independent malleable tasks, Europar 2001, number 2150 in LNCS, pp.191-196, 2001.

R. P. Brent, The Parallel Evaluation of General Arithmetic Expressions, Journal of the ACM, vol.21, issue.2, pp.201-206, 1974.
DOI : 10.1145/321812.321815

E. G. Coffman and P. J. Denning, Operating System Theory, 1972.

D. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos et al., LogP: a practical model of parallel computation, Communications of the ACM, vol.39, issue.11, pp.78-85, 1996.
DOI : 10.1145/240455.240477

D. E. Culler, J. P. Singh, and A. Gupta, Parallel Computer Architecture: A Hardware/Software Approach, 1999.

M. Drozdowski, Scheduling multiprocessor tasks ??? An overview, European Journal of Operational Research, vol.94, issue.2, pp.215-230, 1996.
DOI : 10.1016/0377-2217(96)00123-3

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

D. G. Feitelson, Scheduling parallel jobs on clusters, High Performance Cluster Computing, pp.519-533, 1999.

D. G. Feitelson and L. Rudolph, Parallel job scheduling: Issues and approaches, Lecture Notes in Computer Science, vol.0, issue.949, pp.1-18, 1995.
DOI : 10.1007/3-540-60153-8_20

A. Feldmann, M. Kao, and J. Sgall, Optimal online scheduling of parallel jobs with dependencies, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.642-651, 1993.
DOI : 10.1145/167088.167254

I. Foster, Designing and building parallel programs: concepts and tools for parallel software engineering, 1995.

M. R. Garey and R. L. Graham, Bounds for Multiprocessor Scheduling with Resource Constraints, SIAM Journal on Computing, vol.4, issue.2, pp.187-200, 1975.
DOI : 10.1137/0204015

A. Gerasoulis and T. Yang, PYRROS: static scheduling and code generation for message passing multiprocessors, Proceedings of the 6th ACM International Conference on Supercomputing, pp.428-437

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

L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms, Mathematics of Operations Research, vol.22, issue.3, pp.513-544, 1997.
DOI : 10.1287/moor.22.3.513

D. S. Hochbaum and D. B. Shmoys, Using dual approximation algorithms for scheduling problems theoretical and practical results, Journal of the ACM, vol.34, issue.1, pp.144-162, 1987.
DOI : 10.1145/7531.7535

J. J. Hwang, Y. C. Chow, F. D. Anger, and C. Y. Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM Journal on Computing, vol.18, issue.2, pp.244-257, 1989.
DOI : 10.1137/0218016

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

E. Jeannot, Allocation de graphes de tâches paramétrés et génération de code, 1999.

T. Kalinowski, I. Kort, and D. Trystram, List scheduling of general task graphs under LogP, Parallel Computing, vol.26, issue.9, pp.1109-1128, 2000.
DOI : 10.1016/S0167-8191(00)00031-4

R. Lepère, D. Trystram, and G. J. Woeginger, Approximation scheduling for malleable tasks under precedence constraints, 9th Annual European Symposium on Algorithms -ESA 2001, number 2161 in LNCS, pp.146-157, 2001.

A. Lodi, S. Martello, and M. Monaci, Two-dimensional packing problems: A survey, European Journal of Operational Research, vol.141, issue.2, pp.241-252, 2002.
DOI : 10.1016/S0377-2217(02)00123-6

G. Mounié, Ordonnancement efficace d'applicationparalì eles : les tâches malléables monotones, 2000.

G. Mounié, C. Rapine, and D. Trystram, A 3/2-dual approximation algorithm for scheduling independent monotonic malleable tasks, 2000.

C. A. Phillips, C. Stein, E. Torng, and J. Wein, Optimal time-critical scheduling via resource augmentation (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.140-149, 1997.
DOI : 10.1145/258533.258570

M. Pinedo, Scheduling : theory, algorithms, and systems, 1995.

G. N. Prasanna and B. R. Musicus, Generalised multiprocessor scheduling using optimal control, 3rd Annual ACM Symposium on Parallel Algorithms and Architec tures, pp.216-228, 1991.

C. Rapine, I. Scherson, and D. Trystram, On-line scheduling of parallelizable jobs, Proceedings of EUROPAR'98, number 1470 in LNCS, pp.322-327, 1998.
DOI : 10.1007/BFb0057869

U. Schwiegelshohn, W. Ludwig, J. Wolf, J. Turek, and P. Yu, Smart SMART Bounds for Weighted Response Time Scheduling, SIAM Journal on Computing, vol.28, issue.1, 1998.
DOI : 10.1137/S0097539795286831
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7921

H. Shachnai and J. Turek, Multiresource malleable task scheduling to minimize response time, IPL: Information Processing Letters, pp.47-52, 1999.
DOI : 10.1016/S0020-0190(99)00030-7

D. B. Shmoys, J. Wein, and D. P. Williamson, Scheduling Parallel Machines On-Line, SIAM Journal on Computing, vol.24, issue.6, pp.1313-1331, 1995.
DOI : 10.1137/S0097539793248317

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

B. Monien, T. Decker, and T. Lücking, A 5/4-approximation algorithm for scheduling identical malleable tasks, 2002.

A. S. Tanenbaum and M. Van-steen, Distributed Systems: Principles and Paradigms, 2002.

A. Tchernykh and D. Trystram, On-line scheduling of multiprocessor jobs with idle regulation, Proceedings of PPAM'03, 2003.

D. Trystram and W. Zimmermann, On multi-broadcast and scheduling receive-graphs under logp with long messages, The Fourth International Workshop on Advanced Parallel Processing Technologies -APPT 01, pp.37-48, 2001.

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

J. Werglarz, Optimization and Control of Dynamic Operational Research Models, chapter Modelling and control of dynamic resource allocation project scheduling systems, 1982.

M. Wu and 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9185