Alternatives and similar repositories for CX:

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

• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆171Updated 5 years ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆87Updated 3 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
• lemire / testingmlp
  Testing memory-level parallelism
  ☆67Updated 11 months ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• androm3da / optviewer-demo
  Demonstration of LLVM's opt-viewer tool
  ☆70Updated 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.
  ☆103Updated 5 months ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆105Updated 8 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆82Updated last year
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆29Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆39Updated 4 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• google / hashtable-benchmarks
  ☆104Updated last year
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆154Updated last month
• 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
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆100Updated 6 months ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆121Updated 5 years ago
• scivey / xact
  multi-way atomic compare-and-swap with x64/TSX
  ☆86Updated 8 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆37Updated 3 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆39Updated 4 years ago
• ShimProfiler / SHIM
  ☆53Updated 9 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 2 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago