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
  ☆98Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 6 years ago
• bitslab / ffwd
  This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
  ☆79Updated 7 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆158Updated 2 weeks ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆82Updated last year
• google / hashtable-benchmarks
  ☆109Updated last year
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆74Updated 2 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆22Updated 4 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• androm3da / optviewer-demo
  Demonstration of LLVM's opt-viewer tool
  ☆71Updated 8 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆37Updated 6 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆62Updated last year
• scivey / xact
  multi-way atomic compare-and-swap with x64/TSX
  ☆86Updated 8 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆134Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• stephenrkell / libcrunch
  A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.
  ☆105Updated last year
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago
• eloraiby / tcpm
  Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)
  ☆40Updated 6 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆311Updated 4 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆49Updated 4 years ago