zhuoyw / CLFQ
Implementaions of concurrent lock-free SPSC queue in c++.
☆14Updated 6 years ago
Related projects: ⓘ
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 6 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 10 years ago
- A C++ Raft implementation, project moved☆24Updated 7 years ago
- A simple fast MPMC obstruction-free linearizable concurrent queue for C (based on linux[futex]/gcc/x86_64)☆38Updated 3 years ago
- Simple RPC in C++, with Python binding☆27Updated 9 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 6 years ago
- Raft Consensus Algorithm Implementation in C++ (11)☆25Updated 9 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆67Updated 10 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆14Updated 9 years ago
- W-TinyLFU cache C++11 header only implementation☆55Updated 5 years ago
- Different implementations of spinlock.☆102Updated 9 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆27Updated 8 years ago
- A shell style command line framework which can easily be incorporated into a linux c++ server, supporting telnet/nc clients☆38Updated 3 years ago
- Latency collector as an embedded library for C++☆13Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆55Updated 7 years ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 2 years ago
- Lock-free linked list☆16Updated 11 years ago
- Kosmos Distributed Filesystem☆29Updated 12 years ago
- A high-performance, concurrent hash table☆23Updated 10 years ago
- A lightweight and fast key-value storage engine based on the buffer tree.☆53Updated 10 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆36Updated 3 months ago
- A Paxos implementation in C originally by Marco Primi, built on top of libevent☆35Updated 13 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆41Updated 11 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- An efficient and practical queueing for fast core-to-core communication http://psy-lob-saw.blogspot.co.uk/2013/11/spsc-iv-look-at-bqueue.…☆19Updated 7 years ago
- Lock-free implementation of the token bucket algorithm in C++☆51Updated last year
- C++ implementation of LMAX disruptor☆11Updated 9 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 10 years ago
- A toy SQL engine built on top of LSM(LevelDB)☆24Updated 5 years ago