baserinia / parallel-sortLinks
An efficient C++ multi-threaded sorting function based on C++11 threads
☆27Updated 9 years ago
Alternatives and similar repositories for parallel-sort
Users that are interested in parallel-sort are comparing it to the libraries listed below
Sorting:
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆58Updated 3 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- GPU B-Tree with support for versioning (snapshots).☆52Updated last year
- Parallel Balanced Binary Tree Structures☆122Updated 10 months ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆415Updated 2 months ago
- Concurrent CPU-GPU Programming using Task Models☆105Updated 6 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- A High-performance Cluster Computing Engine☆148Updated 6 years ago
- Asynchronous Multi-GPU Programming Framework☆48Updated 4 years ago
- Packed Memory Array☆17Updated 11 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- TopK Algorithms Benchmark☆10Updated 6 years ago
- UME::SIMD A library for explicit simd vectorization.☆91Updated 8 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…