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
• penberg / hornet
  Hornet, a JVM optimized for low-latency applications.
  ☆53Updated 10 years ago
• jkopinsky / SprayList
  The SprayList data structure
  ☆33Updated 8 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
  ☆102Updated 7 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• habanero-rice / hclib
  A C/C++ task-based programming model for shared memory and distributed parallel computing.
  ☆72Updated 5 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 5 years ago
• farkhor / WS-VR
  A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.
  ☆11Updated 8 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆143Updated 6 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆76Updated 6 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆21Updated 8 years ago
• JoeLeavitt / SkipTrie
  ☆12Updated 8 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 10 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆42Updated 8 years ago
• bthies / streamit
  The StreamIt compiler infrastructure.
  ☆71Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• Sable / HorsePower
  Optimizing database queries with array programming
  ☆20Updated 5 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 3 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 5 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 6 years ago