Alternatives and similar repositories for SprayList

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

• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• ahorn / linearizability-checker
  Fast linearizability checker
  ☆66Updated 9 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆141Updated 5 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆180Updated 7 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 4 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 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.
  ☆42Updated 8 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 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 14 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆53Updated 7 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆208Updated 9 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• google / berrydb
  ☆66Updated 4 years ago
• bthies / streamit
  The StreamIt compiler infrastructure.
  ☆71Updated 8 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• rpclib / benchmarks
  ☆25Updated 8 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆17Updated 6 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 4 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆75Updated 6 years ago