Parallelized merge sort using C pthreads.
-
Updated
Oct 29, 2017 - C
Parallelized merge sort using C pthreads.
Parallel Programming with CILK, OPENMPI, CUDA
#CollectionsLib is a library of Collections (data structures) written entirely in c#
Parallel Computing for Sorting, including parallel quick sort, parallel merge sort, parallel rank sort and their corresponding sequential sorting.
This is the source codes of my programming assignment (Parallel Sorting) of PC2019 (Parallel Computing) courses at NJU.
PSort: Parallel Sorting using Sampling with Randomized and Deterministic Approaches
ImageU: Parallel Combinatorial Algorithms
PSRS: Parallel Sorting using Regular Sampling
Two different implementations of the Parallel Sorting by Regular Sampling
Micro-benchmark comparing parallelSort and Sort.
A parallel stable sort using arbitrary extra memory
Parallel and sequential implementations of different sorting algorithms in C++ using OpenMP and CUDA
A C++ implementation of the paper, On the Versatility of Parallel Sorting by Regular Sampling
implementation for various sorting algorithm in java
Efficient implementations of Merge Sort and Bitonic Sort algorithms using CUDA for GPU parallel processing, resulting in accelerated sorting of large arrays. Includes both CPU and GPU versions, along with a performance comparison.
Stream api (kind of) implementation for go, other useful functions and packages to use go in a functional way
A simple library-less CUDA implementation of the OneSweep sorting algorithm.
Programming assignments in Operating Systems
A compute shader implementation of the OneSweep sorting algorithm.
Add a description, image, and links to the parallel-sorting topic page so that developers can more easily learn about it.
To associate your repository with the parallel-sorting topic, visit your repo's landing page and select "manage topics."