bitslab / ffwdLinks
This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
☆79Updated 8 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
- A simple, reference implementation of a B^e-tree☆160Updated 6 years ago
- Eris distributed transactions☆52Updated 7 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- QSBR and EBR library☆133Updated 6 years ago
- The world's first wait-free Software Transactional Memory☆174Updated 5 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆181Updated 7 years ago
- NOPaxos consensus protocol☆139Updated 5 years ago
- Fast linearizability checker☆67Updated 10 years ago
- Library for Restartable Sequences☆74Updated last month
- Hyaline Reclamation (PLDI '21, PODC '19)☆23Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆211Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Cross-platform atomic operations and lock algorithm library☆100Updated 7 years ago
- Atlas: Programming for Persistent Memory☆76Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- pmwcas☆139Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- User-space Page Management☆111Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Experiments with array layouts for comparison-based searching☆85Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 4 years ago
- Core aware thread management system☆239Updated 2 years ago