gavra0 / ConcLinkedList
Implementation of concurrent linked list. Lock-based and lock-free versions.
☆25Updated 4 years ago
Related projects: ⓘ
- Cross-platform atomic operations and lock algorithm library☆94Updated 6 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆41Updated 11 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆77Updated 8 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆55Updated 7 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 10 years ago
- Library for lock-free locks☆72Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆15Updated 9 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Various benchmarks☆35Updated 12 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆67Updated 10 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆74Updated 10 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆27Updated 8 years ago
- Different implementations of spinlock.☆102Updated 9 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆73Updated 5 years ago
- ☆64Updated 3 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆73Updated 3 years ago
- Benchmark of common hash functions☆34Updated 5 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆19Updated 3 years ago
- QSBR and EBR library☆114Updated 4 years ago
- Adaptive Radix Tree in C++☆36Updated last week
- Fast Concurrent Memoization Map (fcmm) is an almost lock-free concurrent hashmap written in C++11 to be used for memoization in concurren…☆51Updated 6 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆29Updated 6 years ago
- ☆43Updated 3 years ago
- A lock-free priority queue implementation☆29Updated 6 years ago
- Buffer based LRU cache☆36Updated last year
- Benchmarks for our memory allocator☆59Updated 11 months ago
- Lock-free linked list☆16Updated 11 years ago
- [deprecated] Data structures and sample applications using Mintomic☆94Updated 8 years ago