fastly / uslab
Lock-free slab allocator / freelist.
☆65Updated 9 years ago
Alternatives and similar repositories for uslab:
Users that are interested in uslab are comparing it to the libraries listed below
- Concurrent trie-hash map library☆91Updated last year
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- Sphinx is a fast in-memory key-value store, compatible with Memcached.☆32Updated 5 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- ☆24Updated 10 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆86Updated 3 years ago
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆94Updated 5 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆39Updated 10 months ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Automatically exported from code.google.com/p/judyarray☆17Updated 9 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- QSBR and EBR library☆119Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆23Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- unrolled skip list library for C☆21Updated 5 years ago
- The Cicada engine☆55Updated 7 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Library for Restartable Sequences☆70Updated this week
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago