Alternatives and similar repositories for SprayList

Users that are interested in SprayList 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…
  ☆181Updated 7 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆143Updated 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
  ☆177Updated 3 years ago
• gramoli / synchrobench
  A benchmark to compare synchronization techniques for multicore programming
  ☆348Updated 4 months ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆43Updated 8 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆211Updated 9 years ago
• ahorn / linearizability-checker
  Fast linearizability checker
  ☆67Updated 10 years ago
• UWSysLab / Eris
  Eris distributed transactions
  ☆52Updated 7 years ago
• bitslab / ffwd
  This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
  ☆79Updated 7 years ago
• bthies / streamit
  The StreamIt compiler infrastructure.
  ☆71Updated 9 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆102Updated 7 years ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 7 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆76Updated 6 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆32Updated 12 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆139Updated 4 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆143Updated 8 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 5 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆43Updated 8 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 8 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆133Updated 5 years ago
• mozafari / vprofiler
  A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications
  ☆95Updated 7 years ago