loading...
Analysis of Algorithm Selection for Optimizing Collective Communication with MPICH for Ethernet and Myrinet Networks
Adelaide, Australia December 03-December 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2007.65Eighth International Conference on Pa ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
MPICH is probably the most widely used implemen- tation of MPI. Recent versions of MPICH optimize the performance of some collective communications by switching between different algorithms depending on whether the message size is greater or less than a given change-over point, which is currently hard- coded in MPICH, based on measurements on clusters with one CPU per node. We have used MPI bench- marks to find the optimum change-over points for different systems, and found that they can vary sig- nificantly for different networks and different numbers of processes per node. In some cases significant per- formance improvements can be obtained by enabling MPICH to be customized in this way, particularly on clusters with more than one CPU per node. KEY WORDS MPI benchmarks, parallel computer, network per- formance, collective communication.
Citation:
Nor Asilah Wati Adbul Hamid, Paul David Coddington, "Analysis of Algorithm Selection for Optimizing Collective Communication with MPICH for Ethernet and Myrinet Networks," pdcat, pp.133-140, Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions