Determinant / salticidae
Minimal C++ asynchronous network library for distributed systems.
☆36Updated 3 years ago
Alternatives and similar repositories for salticidae:
Users that are interested in salticidae are comparing it to the libraries listed below
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated last month
- ☆51Updated last year
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆72Updated last year
- Fast and efficient file system metadata through LSM-tree☆29Updated 2 years ago
- ☆14Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- An RDMA-powered, fast, and scalable Paxos protocol☆25Updated 5 years ago
- Rabia: Simplifying State-Machine Replication Through Randomization (SOSP 2021)☆41Updated 2 years ago
- Eurosys22' - Rolis: a software approach to efficiently replicating multi-core transactions☆16Updated last year
- Specifying and Verifying the consensus algorithm in PaxosStore using TLA+☆21Updated 4 years ago
- The C++ TiKV client used by TiFlash.☆40Updated 2 months ago
- Pompe implementation based on HotStuff☆16Updated 3 years ago
- Build a beautiful and simple website in literally minutes. Demo at http://deanattali.com/beautiful-jekyll☆34Updated this week
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆35Updated 4 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆39Updated 10 months ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- ☆26Updated 3 years ago
- A Rust port of Yahoo! Cloud Serving Benchmark (YCSB)☆28Updated 2 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 6 years ago
- ☆17Updated 3 years ago
- A high-performance, concurrent hash table☆24Updated 11 years ago
- Specifying and Verfying concensus algorithms in PolarDB using TLA+☆52Updated 7 months ago
- Path Oblivious Heap C++ Reference Implementation☆22Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 6 years ago
- A toy SQL engine built on top of LSM(LevelDB)☆22Updated 5 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- ☆12Updated 6 years ago