A robust dynamic optimization for MPI alltoall operation

Hyacinthe Nzigou Mamadou; Takeshi Nanri; Kazuaki Murakami

doi:10.1109/IPDPS.2009.5160917

A robust dynamic optimization for MPI alltoall operation

Hyacinthe Nzigou Mamadou, Takeshi Nanri, Kazuaki Murakami

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

The performance of the Message Passing Interface collective communications is a critical issue to high performance computing widely discussed. In this paper we propose a mechanism that dynamically selects the most efficient MPI Alltoall algorithm for a given system/workload situation. This implementation method starts by grouping the fast algorithms based on respective performance prediction models that were obtained by using the point-to-point model P-LogP. The experiments performed on different parallel machines equipped with Infiniband and Gigabit Ethernet interconnects produced encouraging results, with negligible overhead to find the most appropriate algorithm to carry on the operation. In most cases, the dynamic Alltoall largely outperforms the traditional MPI implementations on different platforms.

Original language	English
Title of host publication	IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
DOIs	https://doi.org/10.1109/IPDPS.2009.5160917
Publication status	Published - Nov 25 2009
Event	23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009 - Rome, Italy Duration: May 23 2009 → May 29 2009

Publication series

Name	IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Other

Other	23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009
Country/Territory	Italy
City	Rome
Period	5/23/09 → 5/29/09

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
Hardware and Architecture
Software

Access to Document

10.1109/IPDPS.2009.5160917

Cite this

Mamadou, H. N., Nanri, T., & Murakami, K. (2009). A robust dynamic optimization for MPI alltoall operation. In IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium Article 5160917 (IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium). https://doi.org/10.1109/IPDPS.2009.5160917

A robust dynamic optimization for MPI alltoall operation. / Mamadou, Hyacinthe Nzigou; Nanri, Takeshi; Murakami, Kazuaki.
IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium. 2009. 5160917 (IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Mamadou, HN, Nanri, T & Murakami, K 2009, A robust dynamic optimization for MPI alltoall operation. in IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium., 5160917, IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium, 23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009, Rome, Italy, 5/23/09. https://doi.org/10.1109/IPDPS.2009.5160917

@inproceedings{c7655042164b4d1db95e81a9dc8410cb,

title = "A robust dynamic optimization for MPI alltoall operation",

abstract = "The performance of the Message Passing Interface collective communications is a critical issue to high performance computing widely discussed. In this paper we propose a mechanism that dynamically selects the most efficient MPI Alltoall algorithm for a given system/workload situation. This implementation method starts by grouping the fast algorithms based on respective performance prediction models that were obtained by using the point-to-point model P-LogP. The experiments performed on different parallel machines equipped with Infiniband and Gigabit Ethernet interconnects produced encouraging results, with negligible overhead to find the most appropriate algorithm to carry on the operation. In most cases, the dynamic Alltoall largely outperforms the traditional MPI implementations on different platforms.",

author = "Mamadou, {Hyacinthe Nzigou} and Takeshi Nanri and Kazuaki Murakami",

year = "2009",

month = nov,

day = "25",

doi = "10.1109/IPDPS.2009.5160917",

language = "English",

isbn = "9781424437504",

series = "IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium",

booktitle = "IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium",

note = "23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009 ; Conference date: 23-05-2009 Through 29-05-2009",

}

TY - GEN

T1 - A robust dynamic optimization for MPI alltoall operation

AU - Mamadou, Hyacinthe Nzigou

AU - Nanri, Takeshi

AU - Murakami, Kazuaki

PY - 2009/11/25

Y1 - 2009/11/25

N2 - The performance of the Message Passing Interface collective communications is a critical issue to high performance computing widely discussed. In this paper we propose a mechanism that dynamically selects the most efficient MPI Alltoall algorithm for a given system/workload situation. This implementation method starts by grouping the fast algorithms based on respective performance prediction models that were obtained by using the point-to-point model P-LogP. The experiments performed on different parallel machines equipped with Infiniband and Gigabit Ethernet interconnects produced encouraging results, with negligible overhead to find the most appropriate algorithm to carry on the operation. In most cases, the dynamic Alltoall largely outperforms the traditional MPI implementations on different platforms.

AB - The performance of the Message Passing Interface collective communications is a critical issue to high performance computing widely discussed. In this paper we propose a mechanism that dynamically selects the most efficient MPI Alltoall algorithm for a given system/workload situation. This implementation method starts by grouping the fast algorithms based on respective performance prediction models that were obtained by using the point-to-point model P-LogP. The experiments performed on different parallel machines equipped with Infiniband and Gigabit Ethernet interconnects produced encouraging results, with negligible overhead to find the most appropriate algorithm to carry on the operation. In most cases, the dynamic Alltoall largely outperforms the traditional MPI implementations on different platforms.

UR - http://www.scopus.com/inward/record.url?scp=70449793546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449793546&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2009.5160917

DO - 10.1109/IPDPS.2009.5160917

M3 - Conference contribution

AN - SCOPUS:70449793546

SN - 9781424437504

T3 - IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

BT - IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

T2 - 23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009

Y2 - 23 May 2009 through 29 May 2009

ER -

A robust dynamic optimization for MPI alltoall operation

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this