M. Banikazemi, V. Moorthy, and D. K. Panda, Ecient collective communication on heterogeneous networks of workstations, Proceedings of the 27th International Conference on Parallel Processing (ICPP'98)

M. Banikazemi, J. Sampathkumar, S. Prabhu, D. Panda, and P. Sadayappan, Communication modeling of heterogeneous networks of workstations for performance characterization of collective operations, HCW'99, the 8th Heterogeneous Computing Workshop, p.125133, 1999.

A. Bar-noy, S. Guha, J. S. Naor, and B. Schieber, Message multicasting in heterogeneous networks, SIAM Journal on Computing, vol.30, issue.2, p.347358, 2000.

O. Beaumont, V. Boudet, and Y. Robert, A realistic model and an ecient heuristic for scheduling with heterogeneous processors, HCW'2002, the 11th Heterogeneous Computing Workshop, 2002.

O. Beaumont, A. Legrand, and Y. Robert, A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs, ISCIS XVII, Seventeenth International Symposium On Computer and Information Sciences, p.115119, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00807403

O. Beaumont, A. Legrand, and Y. Robert, The masterslave paradigm with heterogeneous processors, IEEE Trans. Parallel Distributed Systems, vol.14, issue.9, p.897908, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00789429

P. Bhat, C. Raghavendra, and V. Prasanna, Ecient collective communication in distributed heterogeneous systems, ICDCS'99 19th International Conference on Distributed Computing Systems, p.1524, 1999.
DOI : 10.1109/icdcs.1999.776502

P. Bhat, C. Raghavendra, and V. Prasanna, Ecient collective communication in distributed heterogeneous systems, Journal of Parallel and Distributed Computing, vol.63, p.251263, 2003.

J. Blazewicz, J. Lenstra, and A. Kan, Scheduling subject to resource constraints, Discrete Applied Mathematics, vol.5, p.1123, 1983.

P. Chrétienne, E. G. Coman, J. K. Lenstra, and Z. Liu, Scheduling Theory and its Applications, 1995.

H. El-rewini, H. H. Ali, and T. G. Lewis, Task scheduling in multiprocessing systems, Computer, vol.28, issue.12, pp.27-37, 1995.

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

L. Hollermann, T. S. Hsu, D. R. Lopez, and K. Vertanen, Scheduling problems in a practical allocation model, J. Combinatorial Optimization, vol.1, issue.2, p.129149, 1997.

T. S. Hsu, J. C. Lee, D. R. Lopez, and W. A. Royce, Task allocation on a network of processors, IEEE Trans. Computers, vol.49, issue.12, p.13391353, 2000.

S. Khuller and Y. Kim, On broadcasting in heterogenous networks, Proceedings of the fteenth annual ACM-SIAM symposium on Discrete algorithms, p.10111020, 2004.

J. Lenstra, R. Graham, E. Lawler, and A. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, vol.5, p.287326, 1979.

J. Y. , -. Leung, and H. Zhao, Minimizing total completion time in master-slave systems, 2004.

J. Y. , -. Leung, and H. Zhao, Minimizing mean owtime and makespan on master-slave systems, J. Parallel and Distributed Computing, vol.65, issue.7, p.843856, 2005.

P. Liu, Broadcast scheduling optimization for heterogeneous cluster systems, Journal of Algorithms, vol.42, issue.1, p.135152, 2002.

M. G. Norman and P. Thanisch, Models of machines and computation for mapping in multicomputers, ACM Computing Surveys, vol.25, issue.3, p.103117, 1993.

J. M. Orduna, F. Silla, and J. Duato, A new task mapping technique for communication-aware scheduling strategies, Workshop for Scheduling and Resource Management for Cluster Computing (ICPP'01), p.349354, 2001.

J. Pineau, Y. Robert, and F. Vivien, O-line and on-line scheduling on heterogeneous master-slave platforms, 2005.

I. Pruhs, J. Sgall, and E. Torng, On-line scheduling, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, 2004.

C. Roig, A. Ripoll, M. A. Senar, F. Guirado, and E. Luque, Improving static scheduling using intertask concurrency measures, Workshop for Scheduling and Resource Management for Cluster Computing (ICPP'01), pp.375-381, 2001.

T. Saif and M. Parashar, Understanding the behavior and performance of non-blocking communications in MPI, Proceedings of Euro-Par 2004: Parallel Processing, vol.3149, p.173182, 2004.

J. Sgall, On line scheduling-a survey, On-Line Algorithms, Lecture Notes in Computer Science 1442, 1998.

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

B. Simons, Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines, SIAM J. Comput, vol.12, issue.2, p.294299, 1983.

O. Sinnen and L. Sousa, Communication contention in task scheduling, IEEE Trans. Parallel Distributed Systems, vol.16, issue.6, p.503515, 2004.

M. Tan, H. J. Siegel, J. K. Antonio, and Y. A. Li, Minimizing the aplication execution time through scheduling of subtasks and communication trac in a heterogeneous computing system, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.8, p.857871, 1997.