Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/44931
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Analysis of algorithm selection for optimizing collective communication with MPICH for ethernet and myrinet networks |
Author: | Abdul Hamid, N. Coddington, P. |
Citation: | Proceedings of Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies, 2007 / pp.133-140 |
Publisher: | IEEE |
Publisher Place: | USA |
Issue Date: | 2007 |
ISBN: | 0769530494 9780769530499 |
Conference Name: | International Conference on Parallel and Distributed Computing, Applications and Technologies (8th : 2007 : Adelaide, South Australia) |
Editor: | Munro, D. |
Statement of Responsibility: | Abdul Hamid, N.A.W. and Coddington, P. |
Abstract: | MPICH is probably the most widely used implementation of MPI. 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 benchmarks to find the optimum change-over points for different systems, and found that they can vary significantly for different networks and different numbers of processes per node. In some cases significant performance improvements can be obtained by enabling MPICH to be customized in this way, particularly on clusters with more than one CPU per node. |
Description: | © Copyright 2008 IEEE – All Rights Reserved |
DOI: | 10.1109/PDCAT.2007.65 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.