baserinia / parallel-sort
An efficient C++ multi-threaded sorting function based on C++11 threads
☆27Updated 8 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:
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆55Updated 2 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆213Updated 2 years ago
- GPU B-Tree with support for versioning (snapshots).☆47Updated 6 months ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 6 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆64Updated 9 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆73Updated 10 years ago
- Simple RPC in C++, with Python binding☆27Updated 10 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- Different implementations of spinlock.☆105Updated 10 years ago
- EDSL for C++ to make just-in-time code generation easier☆86Updated 2 years ago
- ☆25Updated 4 years ago
- Benchmark of common hash functions☆36Updated 5 years ago
- Parallel Balanced Binary Tree Structures☆116Updated last month
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- C++ interfaces for RDMA access☆76Updated last week
- A data structure and algorithm library built for TerarkDB☆62Updated 3 years ago
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆48Updated last month
- A data structure and algorithm library built for ToplingDB☆59Updated this week
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Implementaions of concurrent lock-free SPSC queue in c++.☆17Updated 7 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- Source code for DPTree: Differential Indexing for Persistent Memory☆61Updated 3 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- ☆53Updated 11 months ago
- Low level algorithms for persistent memory.☆16Updated 4 years ago