Alternatives and similar repositories for priorityworkstealing

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

• pgaref / ACaZoo
  A distributed key-value store based on replicated LSM-Trees
  ☆10Updated 8 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 5 years ago
• penberg / hornet
  Hornet, a JVM optimized for low-latency applications.
  ☆53Updated 10 years ago
• jkopinsky / SprayList
  The SprayList data structure
  ☆33Updated 8 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆103Updated 7 years ago
• NonVolatileComputing / pmalloc
  A Portable Persistent Memory Allocation Library
  ☆14Updated 5 years ago
• WitchTools / Witch
  Lightweight performance and debugging tools
  ☆17Updated 5 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 6 years ago
• ucbrise / LatticeFlow
  ☆28Updated 9 years ago
• JoeLeavitt / SkipTrie
  ☆12Updated 8 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 6 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 10 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• habanero-rice / hclib
  A C/C++ task-based programming model for shared memory and distributed parallel computing.
  ☆72Updated 5 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 4 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 5 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 4 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆21Updated 8 years ago
• jinhuang / hyperx
  A Spark Based Scalable Framework for Efficient Hypergraph Processing
  ☆23Updated 10 years ago
• Sable / HorsePower
  Optimizing database queries with array programming
  ☆20Updated 5 years ago