NHSE Review^TM 1997 Volume First Issue

A Survey of MPI Implementations

| <- Prev | Index | Next -> |
NHSE Review^TM: Comments · Archive · Search

Relation of MPI to PVM and HPF

PVM is a package of software that provides message passing functionality as well as infrastructure for building a virtual parallel computer out of a network of workstations [3]. It is often thought of as a competitor to MPI, but it is really a different beast. PVM is a research project of the University of Tennessee at Knoxville and Oak Ridge National Laboratory. While quite popular for writing message passing programs, PVM is a vehicle for performing research in parallel computing rather than a parallel computing standard. Its weaknesses with respect to MPI are also its strengths: it is not bound by an absolute requirement for backward compatibility; its design is not constrained to be efficient on every imaginable MIMD parallel architecture; there is no rigorous specification of PVM behavior. In some sense the tradeoff is between efficiency and portability in MPI, and flexibility and adaptability in PVM.

Successful features of PVM are finding their way into MPI, though MPI is unlikely to provide any support for fault tolerance or a virtual distributed operating system in the near future. Moreover, since PVM is defined by a full implementation rather than a specification, possibilities for interoperability in PVM are higher than in MPI.

HPF is an industry standard for the data parallel model of parallel computation. HPF was standardized a year earlier than MPI, and the successful HPF standardization process was copied by the MPI Forum. Despite the conceptual appeal and simplicity of HPF, MPI is much more widely used than HPF, for several reasons. These include:

• HPF is much more difficult to implement, and to implement efficiently. MPI, on the other hand, has benefited greatly from the large number of good implementations, including an implementation that was available at about the same time the standard was released.
• MPI is a more general model, and can be used to implement almost any parallel computation, while HPF is applicable only to certain types of problems.
• Obtaining high performance in an HPF program can be more difficult than would be expected from the superficial simplicity of the HPF model. It is an open question whether this is a fundamental obstacle or can be addressed by more mature compilers.

Copyright © 1996

| <- Prev | Index | Next -> |
NHSE Review^TM: Comments · Archive · Search