Stream api (kind of) implementation for go, other useful functions and packages to use go in a functional way
-
Updated
Sep 23, 2024 - Go
Stream api (kind of) implementation for go, other useful functions and packages to use go in a functional way
A compute shader implementation of the OneSweep sorting algorithm.
Light and self-contained implementation of C++17 parallel algorithms.
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.
implementation for various sorting algorithm in java
PPQSort - Parallel Pattern Quicksort.
Parallel Computing for Sorting, including parallel quick sort, parallel merge sort, parallel rank sort and their corresponding sequential sorting.
A simple library-less CUDA implementation of the OneSweep sorting algorithm.
Programming assignments in Operating Systems
Two different implementations of the Parallel Sorting by Regular Sampling
Parallel and sequential implementations of different sorting algorithms in C++ using OpenMP and CUDA
Parallel Programming with CILK, OPENMPI, CUDA
PSRS: Parallel Sorting using Regular Sampling
PSort: Parallel Sorting using Sampling with Randomized and Deterministic Approaches
ImageU: Parallel Combinatorial Algorithms
This is the source codes of my programming assignment (Parallel Sorting) of PC2019 (Parallel Computing) courses at NJU.
#CollectionsLib is a library of Collections (data structures) written entirely in c#
A parallel stable sort using arbitrary extra memory
Micro-benchmark comparing parallelSort and Sort.
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."