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
  ☆85Updated 2 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 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 15 years ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• computersforpeace / model-checker
  CDSChecker: A Model Checker for C11 and C++11 Atomics
  ☆34Updated 12 years ago
• google / hashtable-benchmarks
  ☆110Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆38Updated last year
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• jonatanlinden / PR
  A lock-free priority queue implementation
  ☆35Updated 7 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆41Updated 5 years ago
• GorNishanov / await
  ☆128Updated 2 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆136Updated this week
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆77Updated 11 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…
  ☆50Updated 4 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆22Updated 4 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆250Updated 3 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆47Updated 12 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆128Updated 5 years ago
• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆38Updated last month
• bytemaster / fc_malloc
  Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.
  ☆181Updated 12 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆116Updated 9 months 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
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last week
• L-v-M / async
  ☆20Updated 2 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago