Alternatives and similar repositories for ThreadScan

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

• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆182Updated 8 years ago
• gramoli / synchrobench
  A benchmark to compare synchronization techniques for multicore programming
  ☆348Updated 7 months ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆175Updated 5 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆99Updated 7 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆457Updated 2 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…
  ☆118Updated last year
• HdrHistogram / HdrHistogram_c
  C port of the HdrHistogram
  ☆270Updated 5 months ago
• jkopinsky / SprayList
  The SprayList data structure
  ☆33Updated 8 years ago
• lemire / EWAHBoolArray
  A compressed bitmap class in C++.
  ☆460Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago
• pramalhe / ConcurrencyFreaks
  ☆444Updated 3 months ago
• psoberoi / stepanov-conversations-course
  Code for the "Programming Conversations" course
  ☆118Updated 6 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆178Updated 3 years ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆43Updated 8 years ago
• armon / libart
  Adaptive Radix Trees implemented in C
  ☆816Updated 3 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆76Updated 6 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• kuszmaul / SuperMalloc
  A Super Fast Multithreaded malloc() for 64-bit Machines
  ☆293Updated 6 years ago
• chaoran / fast-wait-free-queue
  A benchmark framework for concurrent queue implementations
  ☆297Updated 5 years ago
• apavlo / h-store
  H-Store Distributed Main Memory OLTP Database System
  ☆593Updated 5 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆213Updated 10 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆443Updated 7 months ago
• nitingupta910 / TripleBit
  RDF Graph Database (http://grid.hust.edu.cn/triplebit/)
  ☆11Updated 11 years ago
• multicore-locks / litl
  LiTL: Library for Transparent Lock Interposition
  ☆85Updated 2 years ago
• chaelim / HAMT
  Hash Array Mapped Trie (C++ Templates)
  ☆125Updated 2 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago