Name
Abstract | ||
|---|---|---|
Optimization of MPI collective communication operations has been an active research topic since the advent of MPI in 1990s. Many general and architecture-specific collective algorithms have been proposed and implemented in the state-of-the-art MPI implementations. Hierarchical topology-oblivious transformation of existing communication algorithms has been recently proposed as a new promising approach to optimization of MPI collective communication algorithms and MPI-based applications. This approach has been successfully applied to the most popular parallel matrix multiplication algorithm, SUMMA, and the state-of-the-art MPI broadcast algorithms, demonstrating significant multi-fold performance gains, especially for large-scale HPC systems. In this paper, we apply this approach to optimization of the MPI reduce operation. Theoretical analysis and experimental results on a cluster of Grid'5000 platform are presented. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-21909-7_3 | Parallel Architectures and Compilation Techniques |
Keywords | Field | DocType |
MPI, Reduce, Grid'5000, Communication, Hierarchy | Broadcast algorithm,Computer science,Parallel computing,Algorithm,Collective communication,Implementation,Hierarchy,Matrix multiplication | Conference |
Volume | ISSN | Citations |
9251 | 0302-9743 | 1 |
PageRank | References | Authors |
0.37 | 15 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Khalid Hasanov | 1 | 28 | 3.35 |
| Alexey Lastovetsky | 2 | 763 | 84.50 |