MVAPICH - Misplaced Pages

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "MVAPICH" – news · newspapers · books · scholar · JSTOR (May 2024) (Learn how and when to remove this message)

MVAPICH

Stable release	3.0 / February 16, 2024; 10 months ago (2024-02-16)

Operating system	Unix, Linux
Type	Library
License	New BSD License (free software)
Website	mvapich.cse.ohio-state.edu,mug.mvapich.cse.ohio-state.edu

MVAPICH, also known as MVAPICH2, is a BSD-licensed implementation of the MPI standard developed by Ohio State University. MVAPICH comes in a number of flavors:

MVAPICH2 ("renamed" as "MVAPICH" with the 3.0 releases), with support for InfiniBand, iWARP, RoCE, and Intel Omni-Path
MVAPICH2-X, with support for PGAS and OpenSHMEM
MVAPICH2-GDR, with support for InfiniBand and NVIDIA and AMD GPUs
MVAPICH-PLUS, an enhanced fusing of MVAPICH2-X and MVAPICH2-GDR beginning its releases in 2023/24 with the 3.0 series.
MVAPICH2-MIC, with support for InfiniBand and Intel MIC
MVAPICH2-Virt, with support for InfiniBand and SR-IOV
MVAPICH2-EA, which is energy-aware and supports InfiniBand, iWARP, and RoCE

References

"MVAPICH Home". Retrieved 2021-04-14.
"MVAPICH at NVIDIA Developer". May 2012. Retrieved 28 March 2016.
"MVAPICH :: Overview". Retrieved 2024-05-17.
"MVAPICH 3.0 release changelog". Retrieved 2024-05-17.
"MVAPICH2-GDR 2.3.7 Changelog". Retrieved 2024-05-17.

External links

v t e Parallel computing
General	Distributed computing Parallel computing Massively parallel Cloud computing High-performance computing Multiprocessing Manycore processor GPGPU Computer network Systolic array
Levels	Bit Instruction Thread Task Data Memory Loop Pipeline
Multithreading	Temporal Simultaneous (SMT) Simultaneous and heterogenous Speculative (SpMT) Preemptive Cooperative Clustered multi-thread (CMT) Hardware scout
Theory	PRAM model PEM model Analysis of parallel algorithms Amdahl's law Gustafson's law Cost efficiency Karp–Flatt metric Slowdown Speedup
Elements	Process Thread Fiber Instruction window Array
Coordination	Multiprocessing Memory coherence Cache coherence Cache invalidation Barrier Synchronization Application checkpointing
Programming	Stream processing Dataflow programming Models Implicit parallelism Explicit parallelism Concurrency Non-blocking algorithm
Hardware	Flynn's taxonomy SISD SIMD Array processing (SIMT) Pipelined processing Associative processing MISD MIMD Dataflow architecture Pipelined processor Superscalar processor Vector processor Multiprocessor symmetric asymmetric Memory shared distributed distributed shared UMA NUMA COMA Massively parallel computer Computer cluster Beowulf cluster Grid computer Hardware acceleration
APIs	Ateji PX Boost Chapel HPX Charm++ Cilk Coarray Fortran CUDA Dryad C++ AMP Global Arrays GPUOpen MPI OpenMP OpenCL OpenHMPP OpenACC Parallel Extensions PVM pthreads RaftLib ROCm UPC TBB ZPL
Problems	Automatic parallelization Deadlock Deterministic algorithm Embarrassingly parallel Parallel slowdown Race condition Software lockout Scalability Starvation
Category: Parallel computing

[REDACTED]

This free and open-source software article is a stub. You can help Misplaced Pages by expanding it.

Categories:

See also

References

External links