bitslab / ffwdLinks
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
Sorting:
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- LiTL: Library for Transparent Lock Interposition☆82Updated last year
- A Wait-Free Universal Construct for Large Objects☆97Updated 5 years ago
- NOPaxos consensus protocol☆135Updated 4 years ago
- QSBR and EBR library☆121Updated 5 years ago
- pmwcas☆139Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆152Updated 6 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- Library for Restartable Sequences☆72Updated last week
- 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
- The world's first wait-free Software Transactional Memory☆172Updated 5 years ago
- Fast linearizability checker☆66Updated 10 years ago
- Eris distributed transactions☆52Updated 7 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
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- High-performance multicore-scalable data structures and benchmarks☆141Updated 5 years ago
- The Cicada engine☆57Updated 8 years ago
- ☆53Updated 9 years ago
- User-space Page Management☆107Updated 10 months ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- Transparent Paxos☆44Updated 6 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆160Updated 3 years ago
- Programatically obtain information about the pages backing a given memory region☆77Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago