Abstract
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have been studied for specific networks, general solutions like those available in well-known MPI distributions (e.g. the MPI_Alltoall operation) are strongly influenced by the congestion of network resources. In this paper we present an integrated approach to model the performance of the All-to-All collective operation, which consists in identifying a contention signature that characterizes a given network environment, using it to augment a contention-free communication model. This approach, assessed by experimental results, allows an accurate prediction of the performance of the All-to-All operation over different network architectures with a small overhead.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Christara, C., Ding, X., Jackson, K.: An efficient transposition algorithm for distributed memory computers. In: Proceedings of the High Performance Computing Systems and Applications, pp. 349–368 (1999)
Midorikawa, E.T., Oliveira, H.M., Laine, J.M.: PEMPIs: A new metodology for modeling and prediction of MPI programs performance. In: Proceedings of the SBAC-PAD 2004, pp. 254–261. IEEE Computer Society Press, Los Alamitos (2004)
Barchet-Steffenel, L.A., Mounie, G.: Scheduling heuristics for efficient broadcast operations on grid environments. In: Proceedings of the Performance Modeling, Evaluation and Optimization of Parallel and Distributed Systems Workshop - PMEO’06 (associated to IPDPS’06), Rhodes Island, Greece, Apr. 2006, IEEE Computer Society Press, Los Alamitos (2006)
Kielmann, T., et al.: Network performance-aware collective communication for clustered wide area systems. Parallel Computing 27(11), 1431–1456 (2001)
Chun, A.T.T., Wang, C.-L.: Realistic communication model for parallel computing on cluster. In: Proceedings of the International Workshop on Cluster Computing, pp. 92–101 (1999)
Chun, A.T.T.: Performance Studies of High-Speed Communication on Commodity Cluster. PhD thesis, University of Hong Kong (2001)
Pjesivac-Grbovic, J., et al.: Performance analysis of MPI collective operations. In: Proceedings of the Wokshop on Performance Modeling, Evaluation and Optimisation for Parallel and Distributed Systems (PMEO), in IPDPS (2005)
Johnssonn, S.L., Ho, C.-T.: Optimum broadcasting and personalized communication in hypercubes. IEEE Transactions on Computers 38(9), 1249–1268 (1989)
Grove, D.: Performance Modelling of Message-Passing Parallel Programs. PhD thesis, University of Adelaide (2003)
Adve, V.: Analysing the Behavior and Performance of Parallel Programs. PhD thesis, University of Wisconsin, Computer Sciences Department (1993)
Bruck, J., et al.: Efficient algorithms for all-to-all communications in multiport message-passing systems. IEEE Transactions on Parallel and Distributed Systems 8(11), 1143–1156 (1997)
Clement, M., Steed, M., Crandall, P.: Network performance modelling for PM clusters. In: Proceedings of Supercomputing (1996)
Labarta, J., et al.: DiP: A parallel program development environment. In: Fraigniaud, P., et al. (eds.) Euro-Par 1996. LNCS, vol. 1124, pp. 665–674. Springer, Heidelberg (1996)
König, J.C., Rao, P.S., Trystram, D.: Analysis of gossiping algorithms with restricted buffers. Parallel Algorithms and Applications 13(2), 117–133 (1998)
Jeannot, E.: Two fast and efficient message scheduling algorithms for data redistribution through a backbone. In: Proceedings of the IPDPS (2004)
Moritz, C.A., Frank, M.I.: LoGPC: Modeling network contention in message-passing programs. IEEE Transactions on Parallel and Distributed Systems 12(4), 404–415 (2001)
Hockney, R.W.: The communication challenge for MPP: Intel paragon and meiko cs-2. Parallel Computing 20, 389–398 (1994)
Jeannot, E., Steffenel, L.A.: Fast and Efficient Total Exchange on Two Clusters. In: Kermarrec, A.-M., Bougé, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 848–857. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Steffenel, L.A., Martinasso, M., Trystram, D. (2007). Assessing Contention Effects on MPI_Alltoall Communications. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-72360-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72359-2
Online ISBN: 978-3-540-72360-8
eBook Packages: Computer ScienceComputer Science (R0)