3836 search results - page 15 / 768 » Dynamic Communicators in MPI |
JPDC
2006
13 years 8 months ago
2006
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
PPOPP
2006
ACM
14 years 2 months ago
2006
ACM
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
In order for collective communication routines to achieve high performance on different platforms, they must be able to adapt to the system architecture and use different algori...
ISPA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This article presents the C++ library vShark which reduces the intranode communication overhead of parallel programs on clusters of SMPs. The library is built on top of m...
SC
2005
ACM
14 years 1 months ago
2005
ACM
The paper proposes a novel approach for optimizing performance of all-to-all collective communication by taking advantage of concurrency available in modern networks such as Infin...