Alternatives and similar repositories for flock

Users that are interested in flock are comparing it to the libraries listed below

• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆127Updated 3 months ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 3 months ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last month
• L-v-M / async
  ☆20Updated 2 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆25Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆279Updated 6 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆163Updated 3 years ago
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆165Updated last year
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 5 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…
  ☆110Updated 6 months ago
• google / hashtable-benchmarks
  ☆107Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆106Updated 10 months ago
• LLNL / umap
  User-space Page Management
  ☆109Updated 11 months ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• nkallima / Synch-Framework
  An open-source framework for concurrent data-structures and benchmarks. 🛠️ Latest Dev Branch: v3.4.0-dev 🚀 https://github.com/nkallima/…
  ☆68Updated 3 months ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆35Updated last year
• jonatanlinden / PR
  A lock-free priority queue implementation
  ☆34Updated 7 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆80Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• viktorleis / mmapbench
  ☆137Updated 3 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