swapnil-pimpale / lock-free-BSTLinks
☆10Updated 10 years ago
Alternatives and similar repositories for lock-free-BST
Users that are interested in lock-free-BST are comparing it to the libraries listed below
Sorting:
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Code samples for using libjit☆91Updated 8 years ago
- Mirror kept for legacy. Moved to https://github.com/llvm/llvm-project☆88Updated 5 years ago
- A cross-platform implementation of the Immix Garbage Collector☆77Updated 11 years ago
- Using C++'s type system effectively, safely, expressively☆24Updated 9 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- A distributed key-value cache with builtin materialized views.☆25Updated 10 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- The cilkplus/llvm repo implements the Intel Cilk Plus language extensions to C and C++ in LLVM.☆70Updated 9 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- POSIX-like scalable multicore research OS kernel☆193Updated 5 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆47Updated 12 years ago
- Composable Data and Type Generators for C++☆10Updated 6 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- Distributed Systems Reading Group☆20Updated 7 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆76Updated 6 years ago
- Implements a Min-Heap / Priority Queue in C using a simple array.☆57Updated 5 years ago
- Compiler intermediate language for static analysis.☆107Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆141Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- C++ QD locking library☆11Updated 2 years ago