Skip to content

Repository files navigation

How It Works

  1. The matrix A is broadcasted to all processes.
  2. The matrix B is scattered in columns among all processes.
  3. Each process performs matrix multiplication on its assigned section of B.
  4. The process with the largest element in local matrix B gathers and prints the final result.

About

An implementation of parallel matrix multiplication using MPI for efficient distributed computing across multiple processes.

Resources

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages