Sciweavers

97 search results - page 7 / 20
» Sparse collective operations for MPI
Sort
View
PC
2007
123views Management» more  PC 2007»
13 years 7 months ago
MPI collective algorithm selection and quadtree encoding
Abstract. In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. During the algorithm ...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
EUROPAR
2009
Springer
14 years 2 months ago
Process Mapping for MPI Collective Communications
It is an important problem to map virtual parallel processes to physical processors (or cores) in an optimized way to get scalable performance due to non-uniform communication cost...
Jin Zhang, Jidong Zhai, Wenguang Chen, Weimin Zhen...
SC
2000
ACM
13 years 12 months ago
Automatically Tuned Collective Communications
The performance of the MPI’s collective communications is critical in most MPI-based applications. A general algorithm for a given collective communication operation may not giv...
Sathish S. Vadhiyar, Graham E. Fagg, Jack Dongarra
PVM
1998
Springer
13 years 11 months ago
SKaMPI: A Detailed, Accurate MPI Benchmark
Abstract. SKaMPI is a benchmark for MPI implementations. Its purpose is the detailed analysis of the runtime of individual MPI operations and comparison of these for di erent imple...
Ralf Reussner, Peter Sanders, Lutz Prechelt, Matth...
PAAPP
2010
131views more  PAAPP 2010»
13 years 5 months ago
Accurately measuring overhead, communication time and progression of blocking and nonblocking collective operations at massive s
Accurate, reproducible and comparable measurement of the overheads, communication times and progression behavior of blocking and nonblocking collective operations is a complicated...
Torsten Hoefler, Timo Schneider, Andrew Lumsdaine