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
  ☆88Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆84Updated 2 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆140Updated 3 months ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆43Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• google / hashtable-benchmarks
  ☆113Updated 2 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆63Updated 6 years ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆132Updated 2 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆175Updated 5 years ago
• DolevAdas / Jiffy
  ☆45Updated 5 years ago
• Jiwan / dense_hash_map
  A simple replacement for std::unordered_map
  ☆51Updated last year
• GorNishanov / await
  ☆128Updated 3 years ago
• bytemaster / fc_malloc
  Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.
  ☆185Updated 12 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• Donald-Rupin / zab
  C++20 liburing backed coroutine executor and event loop framework.
  ☆66Updated 3 years ago
• L-v-M / async
  ☆20Updated 3 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆80Updated 11 years ago
• pabloariasal / couring
  C++20 Coroutines and io_uring
  ☆52Updated 3 years ago
• nmmmnu / HM4
  Key/Value NoSQL database that utilize LSM trees
  ☆40Updated last month
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆49Updated 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
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆41Updated 5 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…
  ☆77Updated 2 years ago
• boostorg / boost_unordered_benchmarks
  ☆22Updated 2 months ago
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆173Updated last year
• amdn / itoa
  World's fastest integer to ASCII conversion, C++14 template meta-programming implementation, any size integer 8,16,32,64-bit, signed or u…
  ☆27Updated 9 years ago
• 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
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago