Alternatives and similar repositories for thmap

Users that are interested in thmap are comparing it to the libraries listed below

• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆60Updated 6 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• frevib / epoll-echo-server
  ☆52Updated 5 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 years ago
• rmind / rhashmap
  Robin Hood hash map library
  ☆61Updated 3 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last month
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆66Updated 9 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆163Updated 3 years ago
• ohad-rodeh / bt
  COW b-trees
  ☆101Updated 7 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• rmind / ttimer
  Tick-based timer (hierarchical timing wheel algorithm)
  ☆44Updated 5 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated 3 years ago
• RedisLabs / triemap
  C implementation of a compressed trie lookup map
  ☆21Updated 6 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆29Updated last year
• fanf2 / qp
  qp tries and crit-bit tries
  ☆120Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆154Updated 6 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆41Updated last year
• MarkReedZ / mrloop
  An event loop for C using io_uring
  ☆48Updated last year