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
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆37Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆63Updated last year
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆69Updated 2 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆41Updated 5 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 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
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 12 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
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆61Updated 5 years ago
• google / hashtable-benchmarks
  ☆109Updated last year
• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆38Updated last month
• boostorg / boost_unordered_benchmarks
  ☆22Updated last month
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆284Updated last month
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 8 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆77Updated 11 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆33Updated last year
• Jiwan / dense_hash_map
  A simple replacement for std::unordered_map
  ☆50Updated last year
• rmind / libqsbr
  QSBR and EBR library
  ☆127Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• boostorg / sort
  Boost.Sort
  ☆56Updated 3 weeks ago
• computersforpeace / model-checker
  CDSChecker: A Model Checker for C11 and C++11 Atomics
  ☆34Updated 12 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…
  ☆112Updated 9 months ago
• nmmmnu / HM4
  Key/Value NoSQL database that utilize LSM trees
  ☆40Updated last week
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago