Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
The communication challenge for MPP: Intel Paragon and Meiko CS-2
Parallel Computing
Analyzing the behavior and performance of parallel programs
Analyzing the behavior and performance of parallel programs
Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
Network performance modeling for PVM clusters
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
LoGPC: Modeling Network Contention in Message-Passing Programs
IEEE Transactions on Parallel and Distributed Systems
Network performance-aware collective communication for clustered wide-area systems
Parallel Computing - Clusters and computational grids for scientific computing
DiP: A Parallel Program Development Environment
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Realistic Communication Model for Parallel Computing on Cluster
IWCC '99 Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing
PEMPIs: A New Methodology for Modeling and Prediction of MPI Programs Performance
SBAC-PAD '04 Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing
Performance Analysis of MPI Collective Operations
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
Scheduling heuristics for efficient broadcast operations on grid environments
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast and efficient total exchange on two clusters
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A contention-aware performance model for HPC-based networks: a case study of the InfiniBand network
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
| Hi-index | 0.00 |
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have been studied for specific networks, general solutions like those available in well-known MPI distributions (e.g. the MPI_Alltoall operation) are strongly influenced by the congestion of network resources. In this paper we present an integrated approach to model the performance of the All-to-All collective operation, which consists in identifying a contention signature that characterizes a given network environment, using it to augment a contention-free communication model. This approach, assessed by experimental results, allows an accurate prediction of the performance of the All-to-All operation over different network architectures with a small overhead.