C. Christara, X. Ding, and K. Jackson, An Efficient Transposition Algorithm for Distributed Memory Computers, Proceedings of the High Performance Computing Systems and Applications, pp.349-368, 1999.
DOI : 10.1007/0-306-47015-2_38

E. T. Midorikawa, H. M. Oliveira, and J. M. Laine, PEMPIs: A new metodology for modeling and prediction of MPI programs performance, Proceedings of the SBAC-PAD 2004, pp.254-261, 2004.

L. A. Barchet-steffenel and G. Mounie, Scheduling heuristics for efficient broadcast operations on grid environments, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639634

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

T. Kielmann, H. Bal, S. Gorlatch, K. Verstoep, and R. Hofman, Network performance-aware collective communication for clustered wide-area systems, Parallel Computing, vol.27, issue.11, pp.1431-1456, 2001.
DOI : 10.1016/S0167-8191(01)00098-9

A. T. Chun and C. L. Wang, Realistic communication model for parallel computing on cluster, Proceedings of the International Workshop on Cluster Computing, pp.92-101, 1999.

A. T. Chun, Performance Studies of High-Speed Communication on Commodity Cluster, 2001.

J. Pjesivac-grbovic, T. Angskun, G. Bosilca, G. E. Fagg, E. Gabriel et al., Performance Analysis of MPI Collective Operations, 19th IEEE International Parallel and Distributed Processing Symposium, 2005.
DOI : 10.1109/IPDPS.2005.335

S. L. Johnssonn and C. T. 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. Grove, Performance Modelling of Message-Passing Parallel Programs, 2003.

V. Adve, Analysing the Behavior and Performance of Parallel Programs, Computer Sciences Department, 1993.

J. Bruck, C. T. Ho, S. Kipnis, E. Upfal, and D. Weathersby, Efficient algorithms for all-to-all communications in multiport message-passing systems, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.11, pp.1143-1156, 1997.
DOI : 10.1109/71.642949

M. Clement, M. Steed, and P. Crandall, Network performance modelling for PM clusters, Proceedings of Supercomputing, 1996.

J. Labarta, S. Girona, V. Pillet, T. Cortes, and L. Gregoris, Dip: A parallel program development environment, Proceedings of the 2nd Euro-Par Conference, pp.665-674, 1996.
DOI : 10.1007/BFb0024763

J. C. König, P. S. Rao, and D. Trystram, ANALYSIS OF GOSSIPING ALGORITHMS WITH RESTRICTED BUFFERS, International Journal of Parallel, Emergent and Distributed Systems, vol.13, issue.2, pp.117-133, 1998.
DOI : 10.1080/01495739808947363

E. Jeannot and F. Wagner, Two fast and efficient message scheduling algorithms for data redistribution through a backbone, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004.
DOI : 10.1109/IPDPS.2004.1302902

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

C. A. Moritz and M. I. Frank, LoGPG: Modeling network contention in message-passing programs, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.4, pp.404-415, 2001.
DOI : 10.1109/71.920589

R. Hockney, The communication challenge for MPP: Intel Paragon and Meiko CS-2, Parallel Computing, vol.20, issue.3, pp.389-398, 1994.
DOI : 10.1016/S0167-8191(06)80021-9

E. Jeannot and L. A. Steffenel, Fast and Efficient Total Exchange on Two Clusters, 07 -13th International Euro-Par Conference European Conference on Parallel and Distributed Computing
DOI : 10.1007/978-3-540-74466-5_91

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