Alternatives and similar repositories for paxos

Users that are interested in paxos are comparing it to the libraries listed below

• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 10 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆36Updated 6 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆32Updated 4 months ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆148Updated 5 years ago
• solatis / libpaxos-cpp
  libpaxos-cpp is a C++ implementation of the Paxos distributed consensus protocol
  ☆67Updated 12 years ago
• ohad-rodeh / bt
  COW b-trees
  ☆108Updated 8 years ago
• laysakura / Lock-free_work-stealing_deque_in_C
  Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."
  ☆19Updated 14 years ago
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆270Updated 2 years ago
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆25Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• murraycu / murrayc-compiler-experiments
  Code experiments to exercise ideas while reading "Engineering a Compiler".
  ☆27Updated 6 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• thinkpad20 / sql
  A front-end (lexer, parser and partial compiler) for a subset of the SQL language
  ☆45Updated 12 years ago
• onestraw / epoll-example
  an echo server example based on epoll, a scalable I/O event notification mechanism
  ☆59Updated 2 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)
  ☆83Updated 3 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• ydmao / Metis
  MapReduce for multi-core
  ☆50Updated 12 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆51Updated 8 years ago
• fpgasystems / doppiodb
  doppioDB - A hardware accelerated database
  ☆50Updated 8 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆160Updated 6 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• dbl001 / gperftools
  tcmalloc
  ☆17Updated 11 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆133Updated 6 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• jitesh1337 / mythread_lib
  Our own thread library similar to pthreads
  ☆18Updated 3 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago