Alternatives and similar repositories for llvm-data-structure-benchmarks

Users that are interested in llvm-data-structure-benchmarks are comparing it to the libraries listed below

• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 5 years ago
• google / hashtable-benchmarks
  ☆108Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆35Updated last year
• L-v-M / async
  ☆20Updated 2 years ago
• computersforpeace / model-checker
  CDSChecker: A Model Checker for C11 and C++11 Atomics
  ☆32Updated 11 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆68Updated last year
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 14 years ago
• GorNishanov / await
  ☆127Updated 2 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆281Updated 7 months ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆75Updated 11 years ago
• ricleite / lrmalloc
  A lock-free malloc(3) implementation
  ☆19Updated last month
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 4 years ago
• jonatanlinden / PR
  A lock-free priority queue implementation
  ☆35Updated 7 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…
  ☆48Updated 4 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆25Updated last year
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• node-dot-cpp / alloc-test
  Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical
  ☆46Updated 6 years ago
• 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
• boostorg / sort
  Boost.Sort
  ☆53Updated last month
• mpoeter / emr
  Effective Memory Reclamation
  ☆58Updated 5 years ago