An example implementation of a parallel bitonic sort algorithm using an OpenMPI CPU cluster.
-
Updated
Dec 8, 2012 - C++
An example implementation of a parallel bitonic sort algorithm using an OpenMPI CPU cluster.
Using bash to automate the compilation, scheduling and profiling of MPI / OpenMP applications
High-performance distance matrix computation tool
My labs for Parallel Programming course using MPI, OpenMP and POSIX threads
Distributed-SpMV, c/mpi/openmp, this work was accepted by IEEE/ACM CCGrid'23.
A scalable OpenMPI runtime container for Docker
High Performance Computing MPI for Traveling Salesman Problem
Parallelisation of some algorithms using openMPI & CUDA
PARAL·LELISME I CONCURRÈNCIA Curs 2022-23 EPSEVG
A project that involved C programming. Where we made use of parallel implementations of OpenMPI and Cuda. We compared the performance of these two and attempted to perform K Means and Fuzzy C Means clustering on synthetic data.
This repository consists of classwork and homework of the course High-Performance Computing offered at IIT Madras.
Completed tasks collection for parallel programming course, OpenMP, MPI, 2019
Course project for Future Internet Architecture at Tsinghua University
Parallel and distributed computing problems with C and OpenMPI
K-Means Clustering algorithm in OpenMP/MPI
Add a description, image, and links to the openmpi-cpu-clusters topic page so that developers can more easily learn about it.
To associate your repository with the openmpi-cpu-clusters topic, visit your repo's landing page and select "manage topics."