Alternatives and similar repositories for cola

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

• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆10Updated 4 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• travisdowns / concurrency-hierarchy-bench
  Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-cost…
  ☆26Updated 3 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 6 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆36Updated 6 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• skeeto / stack-clash-coroutine
  Stack clash coroutine demonstration
  ☆12Updated 8 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• stephenrkell / libcrunch
  A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.
  ☆104Updated 9 months ago
• intel / lineuse
  I-cache line packing and branch misprediction measuring tool
  ☆18Updated 8 years ago
• davidad / asm_concurrency
  A demo of concurrency primitives in x64 assembly
  ☆18Updated 3 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• mfragkoulis / PiCO_QL
  SQL query interface to C++ collections and C data structures. Also configurable as a loadable Linux kernel module and an extension to Val…
  ☆14Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• choobin / simple9
  A word-aligned integer compression algorithm.
  ☆12Updated 11 months ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆26Updated 3 years ago
• rurban / nbperf
  Improved NetBSD's Perfect Hash Generation Tool v3
  ☆20Updated last year
• utsaslab / nofs
  The No-Order File System (NoFS)
  ☆47Updated 12 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• jstepien / skrot
  Efficient and customisable compression of short strings
  ☆49Updated 8 years ago
• mis-wut / feathergpu
  ☆15Updated 8 years ago