rescrv / busybee
BusyBee is a high-performance messaging layer
☆39Updated 8 years ago
Alternatives and similar repositories for busybee:
Users that are interested in busybee are comparing it to the libraries listed below
- Library containing high-performance datastructures and utilities for C++☆74Updated 7 years ago
- Open source, distributed, secure data synchronization using the clearskies protocol☆135Updated 10 years ago
- Tick-based timer (hierarchical timing wheel algorithm)☆43Updated 5 years ago
- Boost.Asio wrapper over uTorrent's uTP library☆27Updated 3 years ago
- Crossroads I/O core library☆19Updated 13 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- POSIX wrappers for C++☆30Updated 7 years ago
- nanomsg rpc with protobuf☆39Updated 11 years ago
- Netstring parsing in C☆35Updated 4 years ago
- Small, safe and fast formatting library☆16Updated 6 years ago
- ☆20Updated 10 years ago
- ASIO Cooperative Task for await-based coroutine☆15Updated 6 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- Strongly-typed, dependency based application framework for code/data separation with dependency injection and data passing.☆46Updated 6 years ago
- Lthread C++11 binding☆10Updated 10 years ago
- Consistent Hashing data structures and algorithms for C++☆39Updated 8 years ago
- Go-style coroutines and channels for C++☆33Updated 11 years ago
- A simple, easy to use C++ 11 based HTTP web server☆21Updated 6 years ago
- ☆14Updated 10 years ago
- A C++ implementation of python-style generators, powered by boost::context☆56Updated 10 years ago
- Raft Consensus Algorithm Implementation in C++ (11)☆25Updated 10 years ago
- A multiple thread IO reactor network library for high performance c++ server programming☆7Updated 9 years ago
- cross platform libuv based C++ library that leverages Microsoft's ppl tasks☆35Updated 9 years ago
- Durable dead simple queue that allows zero copy semantics. Durable under failure!☆18Updated 9 years ago
- ☆66Updated 4 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- ☆13Updated last year
- Slab Memory Allocator in Application Layer☆28Updated 7 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