Oaklight / Vesper-raft

Related projects ⓘ

Alternatives and complementary repositories for Vesper-raft

• xingyif / raft
  Raft Consensus Algorithm
  ☆38Updated 6 years ago
• streed / simpleRaft
  A implementation of Raft in pure Python
  ☆294Updated 9 years ago
• simonacca / zatt
  Python implementation of the Raft algorithm for distributed consensus
  ☆156Updated 6 years ago
• zhebrak / raftos
  Asynchronous replication framework for distributed Python projects
  ☆350Updated last year
• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆60Updated 7 years ago
• NicolasLM / bplustree
  An on-disk B+tree for Python 3
  ☆766Updated 5 years ago
• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 7 years ago
• cocagne / multi-paxos-example
  Example multi-paxos application for those learning Paxos & multi-paxos
  ☆91Updated 5 years ago
• lisael / aioraft
  asyncio RAFT algorithm bassed on aiohttp
  ☆31Updated 9 years ago
• cocagne / python-composable-paxos
  Paxos implemented as a set of composable classes
  ☆42Updated 8 years ago
• ustcadsl / diffkv
  ☆58Updated last year
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆121Updated 9 months ago
• ustcadsl / unikv
  ☆24Updated 2 years ago
• haochenpan / rabia
  Rabia: Simplifying State-Machine Replication Through Randomization (SOSP 2021)
  ☆39Updated last year
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 7 years ago
• ajdavis / python-paxos-jepsen
  Paxos in Python, tested with Jepsen
  ☆31Updated 2 years ago
• ut-osa / boki
  Boki: Stateful Serverless Computing with Shared Logs [SOSP '21]
  ☆80Updated 2 years ago
• ylamgarchal / chillaxd
  Python distributed coordination framework.
  ☆33Updated 9 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆149Updated 3 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆76Updated 2 years ago
• kurin / py-raft
  An implementation of the RAFT consensus algorithm.
  ☆91Updated 10 years ago
• papergitkeeper / heavy-keeper-project
  ☆31Updated 5 years ago
• twitter / cache-trace
  A collection of Twitter's anonymized production cache traces.
  ☆174Updated 2 years ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆54Updated 3 years ago
• coleifer / simpledb
  miniature redis-like server implemented in Python
  ☆141Updated last year
• chrislessard / LSM-Tree
  An implementation of an LSM Tree in Python
  ☆48Updated last year
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆119Updated last month
• SJTU-IPADS / xstore
  Fast RDMA-based Ordered Key-Value Store using Remote Learned Cache
  ☆111Updated 3 years ago
• SimonCqk / cannondb
  CannonDB is a lightweight but powerful key-value database created for human beings.
  ☆13Updated 5 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆73Updated 2 years ago