UWSysLab / NOPaxos
NOPaxos consensus protocol
☆134Updated 4 years ago
Alternatives and similar repositories for NOPaxos:
Users that are interested in NOPaxos are comparing it to the libraries listed below
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆207Updated 9 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- pmwcas☆136Updated last year
- Fast linearizability checker☆66Updated 9 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- ☆116Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 5 months ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆114Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- ☆143Updated 2 years ago
- Source code for our OSDI 2016 paper☆110Updated 6 years ago
- The Cicada engine☆55Updated 7 years ago
- Eris distributed transactions☆52Updated 6 years ago
- ☆35Updated last year
- Speculative Paxos replication protocol☆130Updated 8 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆90Updated last year
- Hermes: a fault-tolerant replication protocol, implemented over RDMA, guaranteeing linearizability and achieving low latency and high thr…☆167Updated last year
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆44Updated last year
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆152Updated 6 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- Beta release of Masstree.☆440Updated last year
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆179Updated 7 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- LSM-trie☆113Updated 4 years ago