Multi-queues can be state-of-the-art priority schedulers Postnikova, Anastasiia Koval, Nikita Nadiradze, Giorgi ; https://orcid.org/0000-0001-5634-0731 Alistarh, Dan-Adrian ; https://orcid.org/0000-0003-3650-940X ddc:510 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. Zenodo 2022 info:eu-repo/semantics/other doc-type:other text https://research-explorer.ista.ac.at/record/13076 Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. 2022. doi:<a href="https://doi.org/10.5281/ZENODO.5733408">10.5281/ZENODO.5733408</a> info:eu-repo/semantics/altIdentifier/doi/10.5281/ZENODO.5733408 info:eu-repo/semantics/openAccess