<?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:27:09Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3615" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3615</identifier><datestamp>2017-03-21T16:04:14Z</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="079c8c9b-584d-4c94-b765-32cfc0445b2b" confidence="600">Yang, Zhen</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-04-25T13:01:05Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-04-25T13:01:05Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-04-25T13:01:05Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3615</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">A VLSI chip can today contain hundreds of millions transistors and is expected to&#xd;
contain more than 1 billion transistors in the next decade.&#xd;
In order to handle this rapid growth in integration technology,&#xd;
the design procedure is therefore divided into a sequence of design&#xd;
steps. Circuit layout is the design step in which a physical&#xd;
realization of a circuit is obtained from its functional description.&#xd;
Global routing is one of the key subproblems of the circuit layout&#xd;
which involves finding an approximate path for the wires connecting the&#xd;
elements of the circuit without violating resource constraints.&#xd;
The global routing problem is NP-hard, therefore, heuristics capable of&#xd;
producing high quality routes with little computational effort are required&#xd;
as we move into the Deep Sub-Micron (DSM) regime.&#xd;
&#xd;
In this thesis, different approaches for global routing problem are first&#xd;
reviewed. The advantages and disadvantages of these approaches are also summarized.&#xd;
According to this literature review, several mathematical programming based global&#xd;
routing models are fully investigated. Quality of solution obtained by&#xd;
these models are then compared with traditional Maze routing technique.&#xd;
The experimental results show that the proposed model can optimize several global routing&#xd;
objectives simultaneously and effectively. Also, it is easy to incorporate new&#xd;
objectives into the proposed global routing model.&#xd;
To speedup the computation time of the proposed ILP based global router, several&#xd;
hierarchical methods are combined with the flat ILP based global routing&#xd;
approach. The experimental results indicate that the bottom-up global routing&#xd;
method can reduce the computation time effectively with a slight increase of maximum&#xd;
routing density.&#xd;
In addition to wire area, routability, and vias, performance and low power&#xd;
are also important goals in global routing, especially in deep submicron designs.&#xd;
Previous efforts that focused on power optimization for global routing&#xd;
are hindered by excessively long run times or the routing of a subset of the&#xd;
nets. Accordingly, a power efficient multi-pin global routing&#xd;
technique (PIRT) is proposed in this thesis.&#xd;
This integer linear programming based techniques strives to find a power&#xd;
efficient global routing solution.&#xd;
The results indicate that an average power savings as high as 32\% for the&#xd;
130-nm technology can be achieved with no impact on the maximum chip frequency.</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">VLSI Physical Design</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Standard Cell Global Routing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Integer Linear Programming</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">A Multiple-objective ILP based Global Routing Approach for VLSI ASIC Design</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral 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">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>