Alternatives and similar repositories for CX

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

• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆97Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆172Updated 5 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• bitslab / ffwd
  This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
  ☆78Updated 7 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆31Updated last year
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆68Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆58Updated last year
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• google / hashtable-benchmarks
  ☆106Updated last year
• ShimProfiler / SHIM
  ☆53Updated 9 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆141Updated 5 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• scivey / xact
  multi-way atomic compare-and-swap with x64/TSX
  ☆86Updated 8 years ago
• twizzler-operating-system / twizzler-public
  Public-facing version of the Twizzler OS source code. Note: this is not completely up-to-date with internal Twizzler code.
  ☆65Updated 4 years ago
• androm3da / optviewer-demo
  Demonstration of LLVM's opt-viewer tool
  ☆71Updated 8 years ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• compudj / librseq
  Library for Restartable Sequences
  ☆72Updated last week
• 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
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 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
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆40Updated 5 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆77Updated 3 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆22Updated 3 years ago