Abstract
In this article, we propose an in-place algorithm for irregular all-to-all communication corresponding to the MPI_Alltoallv operation. This in-place algorithm uses a single message buffer and replaces the outgoing messages with the incoming messages. In comparison to existing support for in-place communication in MPI, the proposed algorithm for MPI_Alltoallv has no restriction on the message sizes and displacements. The algorithm requires memory whose size does not depend on the message sizes. Additional memory of arbitrary size can be used to improve its performance. Performance results for a Blue Gene/P system are shown to demonstrate the performance of the approach.
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
MPI Forum: MPI: A Message-Passing Interface Standard Version 2.2. (2009)
Almási, G., Heidelberger, P., Archer, C.J., Martorell, X., Erway, C.C., Moreira, J.E., Steinmacher-Burow, B., Zheng, Y.: Optimization of MPI collective communication on BlueGene/L systems. In: Proc. of the 19th annual Int. Conf. on Supercomputing, pp. 253–262. ACM Press, New York (2005)
Balaji, P., Buntinas, D., Goodell, D., Gropp, W., Kumar, S., Lusk, E., Thakur, R., Träff, J.L.: MPI on a Million Processors. In: Ropo, M., Westerholm, J., Dongarra, J. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface. LNCS, vol. 5759, pp. 20–30. Springer, Heidelberg (2009)
Thakur, R., Choudhary, A., Ramanujam, J.: Efficient Algorithms for Array Redistribution. IEEE Trans. Parallel Distrib. Syst. 7(6), 587–594 (1996)
Walker, D.W., Otto, S.W.: Redistribution of block-cyclic data distributions using MPI. Concurrency - Practice and Experience 8(9), 707–728 (1996)
Lim, Y., Bhat, P., Prasanna, V.: Efficient Algorithms for Block-Cyclic Redistribution of Arrays. Algorithmica 24, 298–330 (1999)
Pinar, A., Hendrickson, B.: Interprocessor Communication with Limited Memory. IEEE Trans. Parallel Distrib. Syst. 15(7), 606–616 (2004)
Siegel, S.F., Siegel, A.R.: MADRE: The Memory-Aware Data Redistribution Engine. Int. J. of High Performance Computing Applications 24, 93–104 (2010)
Siegel, S.F., Siegel, A.R.: A Memory-Efficient Data Redistribution Algorithm. In: Ropo, M., Westerholm, J., Dongarra, J. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface. LNCS, vol. 5759, pp. 219–229. Springer, Heidelberg (2009)
Hofmann, M., Rünger, G.: Fine-Grained Data Distribution Operations for Particle Codes. In: Ropo, M., Westerholm, J., Dongarra, J. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface. LNCS, vol. 5759, pp. 54–63. Springer, Heidelberg (2009)
Siegel, S.F., Siegel, A.R.: MADRE: The Memory-Aware Data Redistribution Engine, Version 0.4 (2010), http://vsl.cis.udel.edu/madre/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hofmann, M., Rünger, G. (2010). An In-Place Algorithm for Irregular All-to-All Communication with Limited Memory. In: Keller, R., Gabriel, E., Resch, M., Dongarra, J. (eds) Recent Advances in the Message Passing Interface. EuroMPI 2010. Lecture Notes in Computer Science, vol 6305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15646-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-15646-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15645-8
Online ISBN: 978-3-642-15646-5
eBook Packages: Computer ScienceComputer Science (R0)