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 7 years ago
• JoeLeavitt / SkipTrie
  ☆13Updated 7 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 4 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆9Updated 5 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• jkopinsky / SprayList
  The SprayList data structure
  ☆32Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• lemire / sparsebitmap
  A simple sparse bitmap implementation in java
  ☆21Updated 9 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆20Updated 6 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• AutomataLab / JPStream
  JPStream: JSONPath Stream Processing in Parallel
  ☆23Updated 2 years ago
• UWSysLab / diamond
  Diamond reactive programming platform
  ☆25Updated 2 years ago
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 4 years ago
• NonVolatileComputing / pmalloc
  A Portable Persistent Memory Allocation Library
  ☆14Updated 4 years ago
• boilerbay / airconcurrentmap
  AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation
  ☆32Updated 7 years ago
• byronlai / lock-free-data-structures
  Lock-free (Non-blocking) Data Structures in Java
  ☆13Updated 9 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 6 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• PlatformLab / TorcDB
  TorcDB: A Low-Latency Graph Database on RAMCloud
  ☆19Updated 5 years ago
• mavam / compbench
  Benchmark and visualization of various compression algorithms
  ☆23Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆161Updated last year
• batterseapower / btreemap
  A simple and high-performance Java B-tree: drop-in replacement for java.util.TreeMap
  ☆28Updated 5 years ago
• habanero-rice / hclib
  A C/C++ task-based programming model for shared memory and distributed parallel computing.
  ☆71Updated 4 years ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago