Alternatives and similar repositories for libshmht

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

• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆88Updated 3 years ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated 3 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆54Updated 10 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• j0sh / radixtree
  The finest radix tree this side of the Linux kernel.
  ☆34Updated 9 years ago
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆24Updated 10 years ago
• spdk / dpdk
  SPDK mirror of DPDK
  ☆60Updated last month
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆192Updated this week
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆78Updated 9 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆51Updated 3 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• bioothod / unetstack
  Userspace TCP/IP stack
  ☆68Updated 11 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• mattsta / crcspeed
  This make CRC be fast. Included implementations: CRC-64-Jones and CRC-16-CCITT
  ☆137Updated 2 years ago
• rmind / ttimer
  Tick-based timer (hierarchical timing wheel algorithm)
  ☆44Updated 5 years ago
• disembl / tree
  An embedded, simple, fast, concurrent, on-disk key-value store using a b+tree.
  ☆40Updated 6 years ago
• hgst / libnvme
  User level NVMe driver library
  ☆66Updated 3 years ago
• colding / disruptorC
  LMAX's disruptor pattern implemented in C
  ☆96Updated last month
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆60Updated 4 years ago
• efficient / nvram
  Tools for safe management of persistent main memory.
  ☆27Updated 11 years ago
• divfor / atomic_hash
  A lock-free hash table that eanble multiple threads can concurrently read/write/delete up to 10M ops/s in mordern computer platform
  ☆52Updated last year
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 4 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆101Updated 6 years ago