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
- GPU B-Tree with support for versioning (snapshots).☆51Updated last year
- Benchmark of common hash functions☆38Updated 6 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 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…☆118Updated last year
- Parallel Balanced Binary Tree Structures☆122Updated 10 months ago
- The Berkeley Container Library☆126Updated last month
- Asynchronous Multi-GPU Programming Framework☆48Updated 4 years ago
- A C++ template class providing a thread-safe LRU cache☆77Updated 3 years ago
- EDSL for C++ to make just-in-time code generation easier☆88Updated 2 years ago
- ☆25Updated 5 years ago
- Task graph-based asynchronous programming system using C++ coroutine☆100Updated last year
- A High-performance Cluster Computing Engine☆148Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Evaluating different memory managers for dynamic GPU memory☆26Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆446Updated last year
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- A SIMD optimized fixed-length string class along with an adaptive hash table for fast searching☆128Updated 4 years ago
- Experimental C++11 version of sparsehash☆294Updated 3 years ago
- STL-style C++ skip_list container☆87Updated 3 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆131Updated 2 years ago
- A fast and highly scalable GPU dynamic memory allocator☆112Updated 10 years ago
- High-performance graph processing on hybrid CPU-GPU platforms by using dynamic load-balancing☆12Updated 9 years ago
- Comprehensive benchmarks of C++ maps☆316Updated 2 years ago
- C++ interfaces for RDMA access☆83Updated last month
- Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU☆22Updated 10 years ago
- A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per se…☆76Updated 2 years ago