Alternatives and similar repositories for B-Queue

Users that are interested in B-Queue are comparing it to the libraries listed below

• rmind / ttimer
  Tick-based timer (hierarchical timing wheel algorithm)
  ☆44Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• zhuoyw / CLFQ
  Implementaions of concurrent lock-free SPSC queue in c++.
  ☆17Updated 8 years ago
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆33Updated 2 years ago
• kurocha / concurrent
  ☆13Updated 2 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆48Updated 12 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• osadalakmal / cpp-raft
  Raft Consensus Algorithm Implementation in C++ (11)
  ☆25Updated 11 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆18Updated 5 years ago
• avsm / ipc-bench
  Latency benchmarks of Unix IPC mechanisms
  ☆100Updated 4 months ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago
• ms705 / ipc-bench
  Latency benchmarks of Unix IPC mechanisms
  ☆20Updated 9 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆42Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆53Updated 4 years ago
• ludocode / schemaless-benchmarks
  Benchmarks for Schemaless Data Serialization Libraries
  ☆58Updated 4 years ago
• chxdeng / mabain
  a fast and light-weighted key-value store library
  ☆48Updated 4 months ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 7 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• dcreager / varon-t
  C implementation of Disruptor queues
  ☆23Updated 3 years ago
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆26Updated 3 years ago
• goldshtn / shmemq-blog
  Shared memory queue benchmarks and tracing for blog
  ☆80Updated 10 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 12 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆17Updated 11 years ago
• baruch / libwire
  User space threading (aka coroutines) library for C resembling GoLang and goroutines
  ☆166Updated 7 years ago
• lightstep / lightstep-tracer-cpp
  The Lightstep distributed tracing library for C++
  ☆39Updated 2 years ago
• colding / disruptorC
  LMAX's disruptor pattern implemented in C
  ☆96Updated 6 months ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago