goldshtn / shmemq-blog
Shared memory queue benchmarks and tracing for blog
☆70Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for shmemq-blog
- Various small bits of code, generally testing small edge cases in the language☆42Updated 2 years ago
- C/C++ high-speed low-latency lightweight memory-mapped diagnostic logger☆27Updated 3 years ago
- Latency benchmarks of Unix IPC mechanisms☆99Updated 5 years ago
- Code example from Crash and Burn lecture☆28Updated 2 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆36Updated 5 months ago
- LMAX's disruptor pattern implemented in C☆95Updated 6 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆138Updated last year
- Our open source benchmarks and code samples☆188Updated last month
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆76Updated 8 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆69Updated 3 years ago
- timing wheel implementation☆14Updated 12 years ago
- Tick-based timer (hierarchical timing wheel algorithm)☆42Updated 4 years ago
- Cross-platform atomic operations and lock algorithm library☆95Updated 6 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆51Updated 8 years ago
- Lock-free implementation of the token bucket algorithm in C++☆53Updated last year
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 13 years ago
- ☆57Updated 3 years ago
- A few libunwind examples☆29Updated 3 years ago
- Different implementations of spinlock.☆103Updated 9 years ago
- QSBR and EBR library☆115Updated 4 years ago
- A public domain lock free queues implemented in C++11☆181Updated 10 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆139Updated 5 years ago
- A lock-free hash table that eanble multiple threads can concurrently read/write/delete up to 10M ops/s in mordern computer platform☆48Updated last year
- A single producer single - single consumer queue implemented by a ring buffer with C11's 'stdatomic.h'☆37Updated 11 months ago
- A C11 implementation of D. Vyukov MPSC queue☆25Updated last year
- Boost.Lockfree☆125Updated last month
- Implementaions of concurrent lock-free SPSC queue in c++.☆14Updated 6 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆67Updated 10 years ago
- https://git.fedorahosted.org/git/libaio.git☆15Updated 8 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆43Updated 11 years ago