UWSysLab / NOPaxosLinks
NOPaxos consensus protocol
☆135Updated 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
- Source code for our OSDI 2016 paper☆110Updated 6 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- pmwcas☆138Updated 2 years ago
- ☆144Updated 2 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Fast linearizability checker☆66Updated 9 years ago
- Hermes: a fault-tolerant replication protocol, implemented over RDMA, guaranteeing linearizability and achieving low latency and high thr…☆169Updated last year
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 7 months ago
- Eris distributed transactions☆52Updated 7 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆91Updated 2 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- A transactional main-memory database system on multicores☆104Updated 6 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
- Beta release of Masstree.☆441Updated last year
- Transparent Paxos☆44Updated 5 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 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 simple, reference implementation of a B^e-tree☆152Updated 6 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- ☆119Updated 3 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- Key Value Store based on LevelDB☆113Updated 3 years ago
- ☆43Updated 3 years ago