Talha-Munir-Saeed3 / MPI-OpenMP-Sorting-Complexity-Study Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

A comprehensive performance analysis of N log N sorting algorithms (Heap, Tim, Intro, Merge, Quick) implemented with hybrid MPI and OpenMP. Explores algorithm complexity, multi-threading (1-16 threads), multi-core (1-4 cores), and scalability on large datasets, with detailed performance graphs.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
README.md		README.md

Repository files navigation

MPI-OpenMP-Sorting-Complexity-Study

About

A comprehensive performance analysis of N log N sorting algorithms (Heap, Tim, Intro, Merge, Quick) implemented with hybrid MPI and OpenMP. Explores algorithm complexity, multi-threading (1-16 threads), multi-core (1-4 cores), and scalability on large datasets, with detailed performance graphs.

c benchmarking openmp mpi parallel-computing distributed-computing multithreading data-structures high-performance-computing sorting-algorithms performance-analysis performance-testing algorithm-efficiency

Report repository

Releases

No releases published

Packages

No packages published