olibre / B-QueueLinks
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.html
☆21Updated 8 years ago
Alternatives and similar repositories for B-Queue
Users that are interested in B-Queue are comparing it to the libraries listed below
Sorting:
- Implementaions of concurrent lock-free SPSC queue in c++.☆17Updated 8 years ago
- Tick-based timer (hierarchical timing wheel algorithm)☆44Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Raft Consensus Algorithm Implementation in C++ (11)☆25Updated 11 years ago
- Dynamic structured data container for C++14☆19Updated 9 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆42Updated last year
- LMAX's disruptor pattern implemented in C☆96Updated 6 months ago
- The Lightstep distributed tracing library for C++☆39Updated 2 years ago
- ☆13Updated 2 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- Latency benchmarks of Unix IPC mechanisms☆100Updated 3 months ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Shared memory queue benchmarks and tracing for blog☆80Updated 10 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- My take on the LMAX Disruptor☆75Updated 12 years ago
- Library containing high-performance datastructures and utilities for C++☆76Updated 8 years ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 8 years ago
- Go-style coroutines and channels for C++☆34Updated 12 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆48Updated 12 years ago
- C11 Lock-free Stack☆184Updated last year
- Fast C/C++ memory allocator with free-all operation☆55Updated 10 years ago
- C implementation of Disruptor queues☆23Updated 3 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- ☆25Updated 5 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 12 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆53Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Latency benchmarks of Unix IPC mechanisms☆20Updated 9 years ago
- Sphinx is a fast in-memory key-value store, compatible with Memcached.☆32Updated 6 years ago