Scribd
Upload
8 views2 pages

MPI vs OpenMP for Matrix Multiplication

This document presents a comparative analysis of MPI and OpenMP for parallel matrix multiplication. It evaluates their efficiency, scalability, and performance, concluding that OpenMP is better for small to medium matrices, while MPI excels with larger matrices. The study highlights the importance of selecting the appropriate parallelization strategy to enhance computational performance.

Uploaded by

t6647147
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views2 pages

MPI vs OpenMP for Matrix Multiplication

This document presents a comparative analysis of MPI and OpenMP for parallel matrix multiplication. It evaluates their efficiency, scalability, and performance, concluding that OpenMP is better for small to medium matrices, while MPI excels with larger matrices. The study highlights the importance of selecting the appropriate parallelization strategy to enhance computational performance.

Uploaded by

t6647147
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Contents

S no. Topic Page no

1. Introduction 01

2. Problem Statement 02

3. Objective 02

4. Implementation 03

5. Results 06

6. Conclusion 08

List of Figures :

fig (4.1) MPI matrix Multiplication-execution time vs process 06

fig (4.2) OpenMp matrix multiplication performance 07

fig (4.3) Mpi vs OpenMp comparative performance for matrix multiplication 07


Abstract
Parallel computing has become an essential approach for achieving high performance in
computationally intensive tasks such as matrix multiplication. This project focuses on the
comparative analysis of two popular parallel programming models—MPI (Message Passing
Interface) and OpenMP (Open Multi-Processing)—used to accelerate matrix multiplication.
The objective is to evaluate their efficiency, scalability, and performance across different numbers
of threads and [Link] implementation of both sequential and parallel versions of matrix
multiplication helps understand how workload distribution affects computation time. MPI uses
distributed-memory communication between processes, while OpenMP employs shared-memory
threading. Execution time and speedup graphs were analyzed to visualize how each model scales
with increasing computational resources. The study concludes that OpenMP performs efficiently
for small to medium-sized matrices on shared-memory systems, whereas MPI shows better
scalability and reduced execution time for large matrices distributed across multiple [Link],
this project demonstrates how choosing the right parallelization strategy can significantly improve
computational performance and resource utilization in scientific and engineering applications.

You might also like