bitslab / ffwd
This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
☆78Updated 7 years ago
Alternatives and similar repositories for ffwd:
Users that are interested in ffwd are comparing it to the libraries listed below
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- LiTL: Library for Transparent Lock Interposition☆79Updated last year
- pmwcas☆135Updated last year
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆178Updated 7 years ago
- Fast linearizability checker☆66Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- NOPaxos consensus protocol☆134Updated 4 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆206Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆157Updated 3 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
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- ☆53Updated 9 years ago
- QSBR and EBR library☆117Updated 5 years ago
- Eris distributed transactions☆52Updated 6 years ago
- The world's first wait-free Software Transactional Memory☆171Updated 5 years ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 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 Cicada engine☆55Updated 7 years ago
- Public-facing version of the Twizzler OS source code. Note: this is not completely up-to-date with internal Twizzler code.☆65Updated 4 years ago
- Atlas: Programming for Persistent Memory☆75Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆82Updated last year
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆74Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆152Updated 5 years ago
- a high performance cache simulator and library☆99Updated 6 months ago
- Experiments in partially ordered SMR.☆48Updated 3 years ago
- User-space Page Management☆106Updated 6 months ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 5 years ago
- An advanced benchmarking tool☆155Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago