<?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-22T16:12:05Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/7423" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/7423</identifier><datestamp>2017-03-21T20:29:50Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="0488c01b-b26e-4e1f-a54a-64c21a7b471b" confidence="600">Beg, Mirza Omer</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-04-22T22:03:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-04-22T22:03:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2013-04-22T22:03:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2013-04-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/7423</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Several important compiler optimizations such as instruction scheduling&#xd;
and register allocation are fundamentally hard and are usually solved using heuristics&#xd;
or approximate solutions.&#xd;
In contrast, this thesis examines optimal solutions to three combinatorial problems in compiler optimization.&#xd;
The first problem addresses instruction scheduling for clustered&#xd;
architectures, popular in embedded systems. Given a set of&#xd;
instructions the optimal solution gives the best possible schedule for a given clustered&#xd;
architectural model. The problem is solved&#xd;
using a decomposition technique applied to constraint programming which determines the spatial and&#xd;
temporal schedule using an integrated approach. The experiments&#xd;
show that our solver can tradeoff some compile time efficiency to solve most instances in&#xd;
standard benchmarks giving significant performance improvements.&#xd;
The second problem addresses&#xd;
instruction selection in the compiler code generation phase.&#xd;
Given the intermediate representation of code the optimal solution&#xd;
determines the sequence of equivalent machine instructions as it optimizes for code size.&#xd;
This thesis shows that a large number of benchmark instances can be solved optimally&#xd;
using constraint programming techniques.&#xd;
The third problem addressed is the placement of data in memory for efficient&#xd;
cache utilization.&#xd;
Using the data access patterns of a given program, our algorithm&#xd;
determines a placement to reorganize data in&#xd;
memory which would result in fewer cache misses.&#xd;
By focusing on graph theoretic placement techniques it is&#xd;
shown that there exist, in special cases, efficient and optimal algorithms for&#xd;
data placement that significantly&#xd;
improve cache utilization. We also propose heuristic solutions for solving larger instances&#xd;
for which provably optimal solutions cannot be determined using polynomial time algorithms.&#xd;
We demonstrate that cache hit rates can&#xd;
be significantly improved by using profiling techniques over a wide range of benchmarks and cache configurations.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Compilers</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Constraint programming</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Cache optimization</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Combinatorial Problems in Compiler Optimization</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">Please ignore the previous version. This is a complete version with the acknowledgements.</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>