A robust dynamic optimization for MPI alltoall operation

Hyacinthe Nzigou Mamadou, Takeshi Nanri, Kazuaki Murakami

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 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 languageEnglish
    Title of host publicationIPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
    DOIs
    Publication statusPublished - Nov 25 2009
    Event23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009 - Rome, Italy
    Duration: May 23 2009May 29 2009

    Publication series

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

    Other

    Other23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009
    CountryItaly
    CityRome
    Period5/23/095/29/09

    All Science Journal Classification (ASJC) codes

    • Computational Theory and Mathematics
    • Hardware and Architecture
    • Software

    Fingerprint Dive into the research topics of 'A robust dynamic optimization for MPI alltoall operation'. Together they form a unique fingerprint.

    Cite this