argv0 / nbds
C implementations of several scalable non-blocking data structures for x86 and x86-64.
☆38Updated 13 years ago
Alternatives and similar repositories for nbds:
Users that are interested in nbds are comparing it to the libraries listed below
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆52Updated last year
- Simple RPC in C++, with Python binding☆27Updated 9 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- ☆25Updated 7 years ago
- unrolled skip list library for C☆21Updated 5 years ago
- Vectorized intersections (research code)☆15Updated 8 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Fast in-memory B+-Tree implementation in C.☆29Updated 9 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- A simple queue using a linked list written in C under the BSD license.☆18Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- A SQL-to-native-code compiler based on LLVM☆47Updated 9 years ago
- Lock-free Transactions without Rollbacks for Linked Data Structures☆22Updated 2 years ago
- QSBR and EBR library☆118Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago