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
• WitchTools / Witch
  Lightweight performance and debugging tools
  ☆17Updated 5 years ago
• jkopinsky / SprayList
  The SprayList data structure
  ☆33Updated 8 years ago
• lemire / sparsebitmap
  A simple sparse bitmap implementation in java
  ☆22Updated 9 years ago
• JoeLeavitt / SkipTrie
  ☆12Updated 8 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 10 years ago
• patinnc / oppat
  Open Power Performance Analysis Tool
  ☆28Updated 3 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆102Updated 7 years ago
• penberg / hornet
  Hornet, a JVM optimized for low-latency applications.
  ☆53Updated 10 years ago
• plasma-umass / sheriff
  Sheriff consists of two tools: Sheriff-Detect, a false-sharing detector, and Sheriff-Protect, a false-sharing eliminator that you can lin…
  ☆32Updated 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
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• hhu-bsinfo / dxram
  A distributed in-memory key-value storage for billions of small objects.
  ☆26Updated 6 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• mjpt777 / presentations
  Presentation slides from conferences
  ☆18Updated 5 years ago
• habanero-rice / hclib
  A C/C++ task-based programming model for shared memory and distributed parallel computing.
  ☆72Updated 5 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆170Updated 3 months ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 5 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• dmargo / sheep
  A scalable distributed graph partitioner. Ongoing research.
  ☆15Updated 8 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
• cyfdecyf / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆14Updated 10 years ago
• travisdowns / concurrency-hierarchy-bench
  Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-cost…
  ☆27Updated 3 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago