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
• jkopinsky / SprayList
  The SprayList data structure
  ☆33Updated 8 years ago
• penberg / hornet
  Hornet, a JVM optimized for low-latency applications.
  ☆53Updated 10 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆43Updated 2 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• NonVolatileComputing / pmalloc
  A Portable Persistent Memory Allocation Library
  ☆14Updated 5 years ago
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆25Updated 6 years ago
• JoeLeavitt / SkipTrie
  ☆12Updated 8 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
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• richardstartin / perfasm-visualiser
  ☆14Updated 6 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 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
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• PANTHEONtech / triemap
  Java port of a concurrent trie hash map implementation from the Scala collections library
  ☆29Updated 6 months ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆167Updated last month
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 4 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• hhu-bsinfo / dxram
  A distributed in-memory key-value storage for billions of small objects.
  ☆24Updated 5 years ago
• mjpt777 / presentations
  Presentation slides from conferences
  ☆18Updated 5 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 10 months ago
• thomasmueller / minperf
  A Minimal Perfect Hash Function Library
  ☆167Updated 4 years ago
• dendibakh / perf-challenge6
  ☆29Updated 2 years ago
• forax / write_your_dynamic_language_runtime
  How to write interpreters or dynamic compilers for dynamically typed languages on top of the JVM
  ☆16Updated 4 months ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago