<?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-22T19:03:10Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3042" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3042</identifier><datestamp>2017-03-21T19:45:28Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</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="cf3abafb-2e68-4196-ab8d-d3b127ae219d" confidence="600">Kandasamy, Santheeban</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-18T13:33:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-18T13:33:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-05-18T13:33:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3042</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Hardware/software partitioning is a process that occurs frequently in embedded system design. It is the&#xd;
procedure of determining whether a part of a system should be implemented in software or hardware.&#xd;
This dissertation is a study of hardware/software partitioning and the use of scheduling algorithms to&#xd;
improve the performance of dynamically reconfigurable computing devices. Reconfigurable computing&#xd;
devices are devices that are adaptable at the logic level to solve specific problems [Tes05]. One example&#xd;
of a reconfigurable computing device is the field programmable gate array (FPGA). The emergence of&#xd;
dynamically reconfigurable FPGAs made it possible to configure FPGAs at runtime. Most current&#xd;
approaches use a simple on demand configuration scheduling algorithm for the FPGA configurations. The&#xd;
on demand configuration scheduling algorithm reconfigures the FPGA at runtime, whenever a&#xd;
configuration is needed and is found not to be configured. The problem with this approach of dynamic&#xd;
reconfiguration is the reconfiguration time overhead, which is the time it takes to reconfigure the FPGA&#xd;
with a new configuration at runtime. Configuration caches and partial configuration have been proposed&#xd;
as possible solutions to this problem, but these techniques suffer from various limitations.&#xd;
The emergence of dynamically reconfigurable FPGAs also made it possible to perform dynamic&#xd;
hardware/software partitioning (DHSP), which is the procedure of determining at runtime whether a&#xd;
computation should be performed using its software or hardware implementation. The drawback of&#xd;
performing DHSP using configurations that are generated at runtime is that the profiling and the dynamic&#xd;
generation of configurations require profiling tool and synthesis tool access at runtime. This study&#xd;
proposes that configuration scheduling algorithms, which perform DHSP using statically generated&#xd;
configurations, can be developed to combine the advantages and reduce the major disadvantages of&#xd;
current approaches. A case study is used to compare and evaluate the tradeoffs between the currently&#xd;
existing approach for dynamic reconfiguration and the DHSP configuration scheduling algorithm based&#xd;
approach proposed in the study. A simulation model is developed to examine the performance of the&#xd;
various configuration scheduling algorithms. First, the difference in the execution time between the&#xd;
different approaches is analyzed. Afterwards, other important design criteria such as power consumption,&#xd;
energy consumption, area requirements and unit cost are analyzed and estimated. Also, business and&#xd;
marketing considerations such as time to market and development cost are considered.&#xd;
The study illustrates how different types of DHSP configuration scheduling algorithms can be&#xd;
implemented and how their performance can be evaluated using a variety of software applications. It is&#xd;
also shown how to evaluate when which of the approaches would be more advantageous by determining&#xd;
the tradeoffs that exist between them. Also the underlying factors that affect when which design&#xd;
alternative is more advantageous are determined and analyzed. The study shows that configuration&#xd;
scheduling algorithms, which perform DHSP using statically generated configurations, can be developed&#xd;
to combine the advantages and reduce some major disadvantages of current approaches. It is shown that&#xd;
there are situations where DHSP configuration scheduling algorithms can be more advantageous than the&#xd;
other approaches.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">883484 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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">HW/SW Partitioning</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Dynamic HW/SW Partitioning: Configuration Scheduling and Design Space Exploration</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Applied Science</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>