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
  ☆83Updated 2 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆41Updated last year
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• google / hashtable-benchmarks
  ☆111Updated last year
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆139Updated last month
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 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
• boostorg / sort
  Boost.Sort
  ☆56Updated last week
• GorNishanov / await
  ☆128Updated 2 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆41Updated 5 years ago
• computersforpeace / model-checker
  CDSChecker: A Model Checker for C11 and C++11 Atomics
  ☆38Updated 12 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆174Updated 5 years ago
• bytemaster / fc_malloc
  Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.
  ☆183Updated 12 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆133Updated 6 years ago
• parapluu / lock_benchmarking
  Benchmarks for locking algorithms as well as implementations of locking algorithms.
  ☆27Updated 7 years ago
• Jiwan / dense_hash_map
  A simple replacement for std::unordered_map
  ☆50Updated last year
• mpoeter / emr
  Effective Memory Reclamation
  ☆63Updated 5 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 3 months ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆126Updated last week
• pabloariasal / couring
  C++20 Coroutines and io_uring
  ☆53Updated 3 years ago
• bloomberg / bde-allocator-benchmarks
  A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.
  ☆33Updated 9 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated 2 years ago
• neumannt / exceptionperformance
  performance experiments for C++ exception handling
  ☆32Updated 3 years ago
• tugrul512bit / LruClockCache
  A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per se…
  ☆75Updated last year
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆47Updated 12 years ago
• boostorg / boost_unordered_benchmarks
  ☆22Updated last month
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆45Updated last year