Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

IMPI: Making MPI Interoperable

Published

Author(s)

William L. George, John G. Hagedorn, J E. Devaney

Abstract

The Message Passing Interface (MPI) is the de facto standard for writing parallel scientific applications in the message passing programming paradigm. Implementations of MPI were not designed to interoperate thus limiting the environments in which parallel jobs could be run. We briefly describe here a set of protocols, designed by a steering committee of current implementors of MPI, that enable two or more implementations of MPI to interoperate within a single application. Specifically, we introduce the set of protocols collectively called Interoperable MPI (IMPI). These protocols make use of novel techniques to handle difficult requirements such as maintaining interoperability among all IMPI implementations while also allowing for the independent evolution of the collective communication algorithms used in IMPI. Our contribution to this effort has been as a facilitator for meetings, editor of the IMPI Standard document, and as an early testbed for implementations of IMPI. This testbed is in the form of an IMPI conformance tester; a system that can verify the correct operation of an IMPI-enabled version of MPI.
Citation
Journal of Research (NIST JRES) -
Volume
105 No. 3

Keywords

conformance testing, distributed processing, interoperable, message passing, MPI, parallel processing

Citation

George, W. , Hagedorn, J. and Devaney, J. (2000), IMPI: Making MPI Interoperable, Journal of Research (NIST JRES), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151467 (Accessed April 21, 2024)
Created May 1, 2000, Updated February 17, 2017