baserinia / parallel-sortLinks
An efficient C++ multi-threaded sorting function based on C++11 threads
☆26Updated 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:
- A na(t)ive proof-of-concept implementation of Apache Spark in C++.☆26Updated 5 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- 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☆56Updated 3 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆73Updated 10 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- C++ interfaces for RDMA access☆77Updated last week
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- GPU B-Tree with support for versioning (snapshots).☆48Updated 8 months ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- ☆25Updated 4 years ago
- Code experiments to exercise ideas while reading "Engineering a Compiler".☆27Updated 6 years ago
- Different implementations of spinlock.☆105Updated 10 years ago
- Benchmark of common hash functions☆36Updated 5 years ago
- Proposal for std::intrusive_ptr☆40Updated 6 years ago
- Simple RPC in C++, with Python binding☆27Updated 10 years ago
- Trie is a lightweight and simple autocompletion data structure written in C++11.☆44Updated 10 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- Low level algorithms for persistent memory.☆16Updated 4 years ago
- Parallel Balanced Binary Tree Structures☆117Updated 3 months ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆65Updated 10 years ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- Buffer based LRU cache☆39Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆54Updated last year
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆75Updated 3 years ago
- a highly cache-friendly hash table☆46Updated 3 years ago