UWSysLab / NOPaxosLinks
NOPaxos consensus protocol
☆138Updated 4 years ago
Alternatives and similar repositories for NOPaxos
Users that are interested in NOPaxos are comparing it to the libraries listed below
Sorting:
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Hermes: a fault-tolerant replication protocol, implemented over RDMA, guaranteeing linearizability and achieving low latency and high thr…☆172Updated last year
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆211Updated 9 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- Source code for our OSDI 2016 paper☆110Updated 6 years ago
- ☆28Updated 3 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…☆180Updated 7 years ago
- The Cicada engine☆59Updated 8 years ago
- A project to implement Augmented Time☆49Updated 11 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- pmwcas☆138Updated 2 years ago
- A fast in-memory key-value store☆51Updated 8 years ago
- ☆149Updated 2 years ago
- An RDMA-powered, fast, and scalable Paxos protocol☆26Updated 6 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- LSM-trie☆114Updated 4 years ago
- Fast linearizability checker☆67Updated 10 years ago
- A collection of state machine replication protocols☆120Updated 2 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year