<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T01:57:22Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/20965" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/20965</identifier><datestamp>2026-09-24T01:13:03Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Down, Douglas</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Mailach, Rachel</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-01-17T21:40:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-01-17T21:40:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/20965</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/16792</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">When scheduling size-aware single server systems, Shortest Remaining Processing Time (SRPT) has strong optimality properties - it minimizes the number of jobs at the server and as a consequence, the mean response time. A major caveat of SRPT is that it requires job sizes a priori. This thesis examines a scenario that is likely to occur in practice, where only estimates of job sizes are available. A single server model and a multi-server model using SRPT are compared to a Class-Based policy that is designed to increase robustness to estimation errors. In the single server model we observe from simulations that such robustness is crucial to achieve good performance. In contrast, we observe that a multi-server system is inherently more robust than a single server system. Both policies work well with the estimation errors in the &#xd;
multi-server system.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Applied Science (MASc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Robustness to Estimation Errors  for Size-Aware Scheduling</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>