jkopinsky / SprayList
The SprayList data structure
☆30Updated 7 years ago
Related projects: ⓘ
- Fast linearizability checker☆65Updated 9 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆47Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆135Updated 5 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Artifact for PPoPP'18☆17Updated 2 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- attempt at summarizing Raft in one page of pseudo-code☆19Updated 6 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆40Updated 7 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 8 years ago
- Prototype of FPaxos, built upon LibPaxos3☆49Updated 4 years ago
- Yesquel: scalable SQL storage for Web apps☆42Updated 7 years ago
- SQL Testing Framework for the Peloton DBMS☆20Updated 6 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 11 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆73Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆47Updated 3 years ago
- AllConcur: Algorithm for LeaderLess CONCURrent atomic broadcast☆29Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆38Updated 4 years ago
- Tests with PlusCal / TLA+☆25Updated 7 years ago
- ☆28Updated 7 years ago
- Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014☆72Updated 9 years ago
- A SQL-to-native-code compiler based on LLVM☆45Updated 8 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆176Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- RWMutex for sharing of multicore machines.☆16Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 13 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Lock-free multithreaded memory allocation☆104Updated 7 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆76Updated 6 years ago
- A lightweight profiler to detect and categorize root causes of synchronization related performance issues in multithreaded programs☆20Updated 7 years ago