<?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-21T04:48:13Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/20357" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/20357</identifier><datestamp>2026-09-24T02:51:53Z</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">Anand, Christopher</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Kahl, Wolfram</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Thaller, Wolfgang</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">2016-09-14T17:25:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-09-14T17:25:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2006-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/20357</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/9366</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">&lt;p> Software Pipelining is a method of instruction scheduling where loops&#xd;
are scheduled more efficiently by executing operations from more than one&#xd;
iteration of the loop in parallel. Finding an optimal software pipelined schedule&#xd;
is NP-complete, but many heuristic algorithms exist. &lt;/p> In iteration i, a software pipelined loop will execute, in parallel, "stage" 1 of iteration i, stage 2 of iteration i- 1 and so on until stage k of iteration i-k+l. &lt;/p> &lt;p> We present a new approach to software pipelining based on using a hemistic algorithm to explicitly assign each operation to its stage before the actual scheduling. &lt;/p> &lt;p> This explicit assignment allows us to implement control flow mechanisms that are hard to implement with traditional methods of software pipelining, which do not give us direct control over what stages instructions are assigned to. &lt;/p></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 Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">software pipelining</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">optimal software</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">pipeline schedule</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">computing</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Explicitly Staged Software Pipelining</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>