There are 1 repository under omp-parallel topic.
Learn OpenMP examples step by step
A compiler to generate OpenMP programs for equations involving constructs like Forall, Summation, etc., frequently used in the scientific domain
A C++ implementation of the Smith - Waterman algorithm. The system consists of 3 different implementations: the one is sequential, while the other two parallelize the execution in a coarse and a fine level respectively, with the use of multithreading.
GPU Parallel Graph Coloring, Shortness Centrality, BFS & Nearest Neighbor Search - CS 406 Homework
Solves Helmholtz equation with Jacoby and red-black i Iterative methods.
Mini-project codes: Java, C++, Matlab, OpenMP, MPI, OpenCL, p_thread and Assembly Language.
Kmeans clustering using c , openmp , cuda and mpi program
Histogram multithread calculations of an image done in the three ways: OMP, MPI, CUDA.
Small educational RayTracing project in C++, featuring many texture types and mappings, soft shadows, realistic defocus and acceleration structures for fast inference.
Neural Network for recognition of handwritten digits.
Parallellization of the Kmeans algorithm with OpenMP
Parallelisierung mit OpenMP. Beinhaltet Beispiel und kontrete Implementierungen
FDD3260 Group Work: A parallel implementation of speedy.f90
Simple, modular, cross platform and portable database management studio.
quantum irregular dynamics simulator
KMeans With OMP Parallelization
Using C to calculate numerical solution to the advection equation by a logarithmic profile representation to simulate the movement of a cloud of material in the atmospheric boundary layer.
Various configurations for Sieve of Eratosthenes algorithm. Approaches to optimize performance by using features like openmp, chunking and branch-predictor.
A C++ project to detect mutations on DNA sequence, comparing two DNA samples. This project was built based on a Supercomputing subject and some classic algorithms are used in this project, such as Smith Waterman, Random Local Search and Exaustive Search
Implementation of parallel algorithms
Parallel programming with OMP to solve JobShop algorithm
This project was realized in binomial during my bac+3 at the University of Strasbourg. We had to make a google hash code faster.
Parallel and Distributed Computing
TITLE: The project is titled as Execution Number Cruncher. INTRODUCTION: Execution Number Cruncher, like its name hints, will figure and calculate the exhibition/performance of certain IPC (Inter Process Communications) approaches dependent on a proper algorithm. The program will let the customer/client realize which approach is superior to the next by positioning them from best to most exceedingly terrible. The program will likewise show the time taken by the chosen issues/problems to execute utilizing each upheld IPC approach. Approaches: This program will support the following IPC approaches: 1) Filing 2) Message Queue Project Description: In this project, we came up with 2 methods of inter-process communication; message passing and filing, and we applied three methods to each of mentioned approaches. Problems: Chatbot Chatbot: In this problem, message could be send and receive on either terminals. Problem will also notify if other person is typing a message. Comparison: Filing= 0.000076 Message Queue= 0.00072 The result shows that when this problem was done using filing it took 0.000076 while using message queue time taken was 0.00072 , which shows filing approach was faster . *Important: This is Linux based project. Might throw errors on Windows and MAC OS.
Compute the steady-state temperature of a two-dimensional homogenous plate by randomly walking on the plate.
Small Scale Parallel Programming, Sparse Matrix multiplication with CUDA
Parallelization of the successful overrelaxation using OMP and MPI
Practice files for high performance computation in C++
Практическое задание по лекционному курсу СКиПОД 5-го семестра ВМК МГУ (2021/2022 учебного года)
Vote counting system using parallel programming (OMP) and hash tables