Alternatives and similar repositories for scal

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

• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆172Updated 5 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• cksystemsgroup / scalloc
  A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator
  ☆163Updated 2 weeks ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆206Updated 4 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• chaelim / HAMT
  Hash Array Mapped Trie (C++ Templates)
  ☆124Updated 2 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• chaoran / fast-wait-free-queue
  A benchmark framework for concurrent queue implementations
  ☆291Updated 5 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆192Updated last week
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• google / hashtable-benchmarks
  ☆107Updated last year
• androm3da / optviewer-demo
  Demonstration of LLVM's opt-viewer tool
  ☆71Updated 8 years ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆108Updated 6 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆134Updated 5 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 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. …
  ☆30Updated 14 years ago
• cleeus / obstack
  A C++ pointer bump memory arena implementation
  ☆93Updated 10 years ago
• brianwatling / libfiber
  A User Space Threading Library Supporting Multi-Core Systems
  ☆140Updated last year
• 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
• kirkshoop / transducer
  transducers in C++ 14
  ☆40Updated 10 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆310Updated 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
• 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
• scivey / xact
  multi-way atomic compare-and-swap with x64/TSX
  ☆86Updated 8 years ago