shamsimam / priorityworkstealing
A decentralized work-stealing scheduler that dynamically schedules fixed-priority tasks in a non-preemptive manner.
☆18Updated 9 years ago
Related projects ⓘ
Alternatives and complementary repositories for priorityworkstealing
- A distributed key-value store based on replicated LSM-Trees☆10Updated 7 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- FOundation of stXXl and thriLL☆14Updated 10 months ago
- A benchmark for cache efficient data structures.☆29Updated 5 years ago
- Parallel boolean circuit evaluation☆19Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- A Portable Persistent Memory Allocation Library☆13Updated 4 years ago
- Persistent Memory Graph Database☆43Updated last year
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- JPStream: JSONPath Stream Processing in Parallel☆23Updated 2 years ago
- Hornet, a JVM optimized for low-latency applications.☆53Updated 9 years ago
- Stream processing engine☆12Updated 3 years ago
- ☆29Updated 7 years ago
- Presentation slides from conferences☆18Updated 4 years ago
- Open Power Performance Analysis Tool☆26Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆25Updated 5 years ago
- A simple and high-performance Java B-tree: drop-in replacement for java.util.TreeMap☆28Updated 5 years ago
- ☆13Updated 7 years ago
- A simple sparse bitmap implementation in java☆21Updated 8 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- A distributed in-memory key-value storage for billions of small objects.☆23Updated 5 years ago
- ☆15Updated 6 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆9Updated 4 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 5 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- A C/C++ task-based programming model for shared memory and distributed parallel computing.☆71Updated 4 years ago
- The SprayList data structure☆30Updated 7 years ago
- Diamond reactive programming platform☆26Updated 2 years ago