GPU-accelerated triangle mesh processing

GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016

Algorithms implemented in CUDA + resources about GPGPU

Parallel reduction of boundary matrices for Persistent Homology with CUDA

Parallel Computing starter project to build GPU & CPU kernels in CUDA & C++ and call them from Python without a single line of CMake using PyBind11

a real-time N-body simulation with the Barnes-Hut algorithm and CUDA

University of Toronto / ECE1782 - Programming Massively Parallel Multiprocessors and Heterogeneous Systems / Project: an optimized CUDA Implementation of AES 128-bit Encryption, support any file types, benchmarked with OpenSSL

Parallel SpMV using CSR representation, built in CUDA

Case studies constitute a modern interdisciplinary and valuable teaching practice which plays a critical and fundamental role in the development of new skills and the formation of new knowledge. This research studies the behavior and performance of two interdisciplinary and widely adopted scientific kernels, a Fast Fourier Transform and Matrix M…

This is a LSQR-CUDA implementation written by Lawrence Ayers under the supervision of Stefan Guthe of the GRIS institute at the Technische Universität Darmstadt. The LSQR library was authored Chris Paige and Michael Saunders.

In this code is provided a simple, efficient and fast method to calculate motion and backgroud dynamically using nVidia GPUs power

Inline PTX Assembly in CUDA example

Parallel implementation of Nearest Neighbour Search algorithm

Parallel 1D Empirical Mode Decomposition (EMD) on GPU for processing multiple signals. For each IMF, it computes the upper and lower envelopes and identifies critical points (local maxima and minima).

A way to compute PCA through CUDA and GPU

A GPU-Accelerated Clustering Algorithm that uses the Hungarian method

Playing with CUDA and GPUs in Google Colab

C++ implementation of a neural network using OpenMP and CUDA for parallelization.

K-Means algorithm parallelized in CUDA

This is a program to solve the job shop scheduling problem by using the parallel genetic algorithm