bitslab / ffwdLinks
This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
☆79Updated 7 years ago
Alternatives and similar repositories for ffwd
Users that are interested in ffwd are comparing it to the libraries listed below
Sorting:
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- LiTL: Library for Transparent Lock Interposition☆84Updated 2 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Fast linearizability checker☆67Updated 10 years ago
- NOPaxos consensus protocol☆138Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- QSBR and EBR library☆127Updated 5 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Library for Restartable Sequences☆74Updated 2 months ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆211Updated 9 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆22Updated 4 years ago
- pmwcas☆138Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Eris distributed transactions☆52Updated 7 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- User-space Page Management☆108Updated last year
- A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).☆78Updated 3 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated last year
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- Atlas: Programming for Persistent Memory☆76Updated 4 years ago