Published January 3, 2022
| Version v1.1
Conference paper
Open
Multi-Queues Can Be State-of-the-Art Priority Schedulers
Authors/Creators
- 1. ITMO University
- 2. JetBrains
- 3. IST Austria
Description
The source code for replicating experiments presented in the paper.
The implementation of the designed priority schedulers can be found in Galois-2.2.1/include/Galois/WorkList/:
- StealingMultiQueue.h is the StealingMultiQueue.
- MQOptimized/ contains MQ Optimized variants.
We provide images that contain all the dependencies and datasets. Images can be pulled from npostnikova/mq-based-schedulers repository, or downloaded from Zenodo. See readme for more detail.
Files
npostnikova/mq-based-schedulers-v1.1.zip
Files
(7.4 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:fd650be5396a9c566cee14f14bce046e
|
7.4 MB | Preview Download |
|
md5:bdad734454fb3d242ba78796d5b0f3a5
|
7.0 kB | Preview Download |
Additional details
Related works
- Is supplement to
- https://github.com/npostnikova/mq-based-schedulers/tree/v1.1 (URL)