Efficient Algorithms for Array Redistribution
IEEE Transactions on Parallel and Distributed Systems
Interprocessor Communication with Limited Memory
IEEE Transactions on Parallel and Distributed Systems
Optimization of MPI collective communication on BlueGene/L systems
Proceedings of the 19th annual international conference on Supercomputing
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Fine-Grained Data Distribution Operations for Particle Codes
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A Memory-Efficient Data Redistribution Algorithm
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Madre: the Memory-Aware Data Redistribution Engine
International Journal of High Performance Computing Applications
In-place algorithms for the symmetric all-to-all exchange with MPI
Proceedings of the 20th European MPI Users' Group Meeting
Optimizing Memory Constrained Environments in Monte Carlo Nuclear Reactor Simulations
International Journal of High Performance Computing Applications
| Hi-index | 0.00 |
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.