<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>thesis</genre>

<titleInfo><title>Multi-queues can be state-of-the-art priority schedulers</title></titleInfo>





<name type="personal">
  <namePart type="given">Anastasiia</namePart>
  <namePart type="family">Postnikova</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Nikita</namePart>
  <namePart type="family">Koval</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">2F4DB10C-F248-11E8-B48F-1D18A9856A87</identifier></name>
<name type="personal">
  <namePart type="given">Giorgi</namePart>
  <namePart type="family">Nadiradze</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">3279A00C-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-5634-0731</description></name>
<name type="personal">
  <namePart type="given">Dan-Adrian</namePart>
  <namePart type="family">Alistarh</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">4A899BFC-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0003-3650-940X</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">DaAl</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">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.</abstract>

<originInfo><publisher>Zenodo</publisher><dateIssued encoding="w3cdtf">2022</dateIssued>
</originInfo>



<relatedItem type="host"><identifier type="doi">10.5281/ZENODO.5733408</identifier>
<part>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/11180</url>  </location>
</relatedItem>

<relatedItem type="Supplementary material">
  <location>
  
     <url>https://github.com/npostnikova/mq-based-schedulers/tree/v1.1</url>
  
  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<short>A. Postnikova, N. Koval, G. Nadiradze, D.-A. Alistarh, (2022).</short>
<chicago>Postnikova, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” Zenodo, 2022. &lt;a href=&quot;https://doi.org/10.5281/ZENODO.5733408&quot;&gt;https://doi.org/10.5281/ZENODO.5733408&lt;/a&gt;.</chicago>
<ama>Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. 2022. doi:&lt;a href=&quot;https://doi.org/10.5281/ZENODO.5733408&quot;&gt;10.5281/ZENODO.5733408&lt;/a&gt;</ama>
<ista>Postnikova A, Koval N, Nadiradze G, Alistarh D-A. 2022. Multi-queues can be state-of-the-art priority schedulers, Zenodo, &lt;a href=&quot;https://doi.org/10.5281/ZENODO.5733408&quot;&gt;10.5281/ZENODO.5733408&lt;/a&gt;.</ista>
<mla>Postnikova, Anastasiia, et al. &lt;i&gt;Multi-Queues Can Be State-of-the-Art Priority Schedulers&lt;/i&gt;. Zenodo, 2022, doi:&lt;a href=&quot;https://doi.org/10.5281/ZENODO.5733408&quot;&gt;10.5281/ZENODO.5733408&lt;/a&gt;.</mla>
<apa>Postnikova, A., Koval, N., Nadiradze, G., &amp;#38; Alistarh, D.-A. (2022). Multi-queues can be state-of-the-art priority schedulers. Zenodo. &lt;a href=&quot;https://doi.org/10.5281/ZENODO.5733408&quot;&gt;https://doi.org/10.5281/ZENODO.5733408&lt;/a&gt;</apa>
<ieee>A. Postnikova, N. Koval, G. Nadiradze, and D.-A. Alistarh, “Multi-queues can be state-of-the-art priority schedulers.” Zenodo, 2022.</ieee>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>13076</recordIdentifier><recordCreationDate encoding="w3cdtf">2023-05-23T17:05:40Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-04-14T13:51:59Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
