jkopinsky / SprayList
The SprayList data structure
☆33Updated 8 years ago
Alternatives and similar repositories for SprayList
Users that are interested in SprayList are comparing it to the libraries listed below
Sorting:
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Fast linearizability checker☆66Updated 9 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆179Updated 7 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- Yesquel: scalable SQL storage for Web apps☆42Updated 7 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆74Updated 6 years ago
- Transparent Paxos☆44Updated 5 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Diamond reactive programming platform☆25Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 2 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆176Updated 3 years ago
- Prototype of FPaxos, built upon LibPaxos3☆48Updated 5 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago