Alternatives and similar repositories for klsm

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

• efficient / ARF
  ☆11Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆26Updated 7 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 7 years ago
• aclements / objbrowse
  Interactive object file browser with symbol, source, assembly, and analysis
  ☆22Updated last year
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• wdamron / x64
  x86-64 instruction encoder in Go
  ☆22Updated 6 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆34Updated 8 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• dankamongmen / libtorque
  A threaded, continuations-based I/O event library for manycore NUMA machines
  ☆76Updated 4 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 10 years ago
• tabokie / coplus
  Parallel programming library in C++11
  ☆13Updated 6 years ago
• smokku / libconcurrency
  A lightweight concurrency library for C, featuring symmetric coroutines as the main control flow abstraction.
  ☆12Updated 10 years ago
• thanm / dragongo
  LLVM IR generation "middle end" for LLVM-based go compiler.
  ☆18Updated 3 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆53Updated 7 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆48Updated 12 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆19Updated 6 months 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
• eloraiby / tcpm
  Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)
  ☆40Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆70Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 10 years ago