.png){kind=icon}
.png){kind=icon}
Return
A PIPELINED ALGORITHM FOR LARGE, IRREGULAR ALL-GATHER PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1177/1094342009359013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We describe and evaluate a new pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes individual data of possibly different size, and all processes have to collect all data from all processes. The pipelined algorithm is useful for the implementation of the MPI_Allgatherv collective operation of the Message-Passing Interface (MPI) for large problems. By conception, the new algorithm is well suited to implementation on clustered multiprocessors, such as symmetric multiprocessing (SMP) clusters. The new algorithm has been implemented within different MPI libraries. Benchmark results on NEC SX-8, Linux clusters with InfiniBand and Gigabit Ethernet, IBM Blue Gene/P, and SiCortex systems show huge performance gains in accordance with the expected behavior.
Keywords:
message-passing interface
collective operations
all-gather problem
pipelining
NEC SX-8
Linux clusters
IBM Blue Gene/P
SiCortex
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.1K
Citations:
1.3K
Organization
View more organizations