jkopinsky / SprayList
The SprayList data structure
☆32Updated 8 years ago
Alternatives and similar repositories for SprayList:
Users that are interested in SprayList are comparing it to the libraries listed below
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 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
- Yesquel: scalable SQL storage for Web apps☆42Updated 7 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
- 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
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- Fast linearizability checker☆66Updated 9 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
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆74Updated 6 years ago
- RWMutex for sharing of multicore machines.☆17Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 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
- RLU resizable hash-table☆17Updated 9 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆78Updated 7 years ago
- ☆32Updated 7 years ago
- Sheriff consists of two tools: Sheriff-Detect, a false-sharing detector, and Sheriff-Protect, a false-sharing eliminator that you can lin…☆32Updated 6 years ago
- A lightweight profiler to detect and categorize root causes of synchronization related performance issues in multithreaded programs☆21Updated 7 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- A distributed key-value store based on replicated LSM-Trees☆10Updated 7 years ago
- Artifact for PPoPP'18☆19Updated 2 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 4 years ago