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
  ☆87Updated 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 5 years ago
• google / hashtable-benchmarks
  ☆106Updated last year
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆31Updated last year
• bitslab / ffwd
  This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
  ☆79Updated 7 years ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆68Updated last year
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• androm3da / optviewer-demo
  Demonstration of LLVM's opt-viewer tool
  ☆71Updated 8 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 7 months ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆73Updated 2 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 3 years ago
• ShimProfiler / SHIM
  ☆53Updated 9 years ago
• backtrace-labs / slitter
  Slitter is a C- and Rust-callable slab allocator implemented primarily in Rust, with some C for performance or to avoid unstable Rust fea…
  ☆145Updated 3 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
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆56Updated last year
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆133Updated 5 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆105Updated 9 months ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 3 months ago
• marcin-osowski / cmov
  Measuring cmov vs branch-mov performance
  ☆86Updated 7 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆20Updated 3 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago
• bpowers / mstat
  fine-grained, cgroup-based tool for profiling memory usage over time of a process tree
  ☆46Updated 10 months ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆45Updated 4 months ago