Alternatives and similar repositories for ipc-bench

Users that are interested in ipc-bench are comparing it to the libraries listed below

• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 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 7 years ago
• olibre / B-Queue
  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.…
  ☆21Updated 8 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆41Updated last year
• avsm / ipc-bench
  Latency benchmarks of Unix IPC mechanisms
  ☆100Updated 5 years ago
• osadalakmal / cpp-raft
  Raft Consensus Algorithm Implementation in C++ (11)
  ☆25Updated 10 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• murraycu / murrayc-compiler-experiments
  Code experiments to exercise ideas while reading "Engineering a Compiler".
  ☆27Updated 6 years ago
• hoterran / simple-timing-wheel
  timing wheel implementation
  ☆14Updated 13 years ago
• ix-project / zygos
  ☆32Updated 7 years ago
• goldshtn / shmemq-blog
  Shared memory queue benchmarks and tracing for blog
  ☆80Updated 9 years ago
• rmind / ttimer
  Tick-based timer (hierarchical timing wheel algorithm)
  ☆44Updated 5 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• kurocha / concurrent
  ☆13Updated 2 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• cyfdecyf / spinlock
  Different implementations of spinlock.
  ☆105Updated 10 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆76Updated 4 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• apc999 / libcuckoo
  A high-performance, concurrent hash table
  ☆24Updated 11 years ago
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆25Updated 3 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 5 years ago
• dcreager / varon-t
  C implementation of Disruptor queues
  ☆23Updated 3 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆87Updated 3 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆62Updated 6 years ago