bitslab / ffwd
This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
☆78Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for ffwd
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆47Updated 9 years ago
- LiTL: Library for Transparent Lock Interposition☆78Updated last year
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆33Updated 5 years ago
- A simple, reference implementation of a B^e-tree☆148Updated 5 years ago
- pmwcas☆135Updated last year
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆76Updated 2 years ago
- QSBR and EBR library☆116Updated 4 years ago
- Eris distributed transactions☆52Updated 6 years ago
- Library for Restartable Sequences☆67Updated last month
- NOPaxos consensus protocol☆133Updated 4 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
- Fast linearizability checker☆66Updated 9 years ago
- The world's first wait-free Software Transactional Memory☆169Updated 4 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆204Updated 8 years ago
- A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).☆75Updated 2 years ago
- The Cicada engine☆56Updated 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
- The world's first wait-free KV store with generic durable linearizable transactions☆38Updated 2 years ago
- User-space Page Management☆104Updated 3 months ago
- ☆37Updated 7 months ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆149Updated 3 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- https://www.usenix.org/conference/atc20/presentation/boucher☆24Updated 2 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆93Updated 5 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 5 years ago
- ☆54Updated 9 years ago