<?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-22T11:54:28Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/9461" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/9461</identifier><datestamp>2017-09-11T20:14:18Z</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="2bc63a6e-f1c9-4401-a922-f519e581c1ef" confidence="600">Jesuthasan, Jude Arun Selvan</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-07-10T15:24:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-07-10T15:24:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-07-10</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2015-07-09</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/9461</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In the modern deep-submicron Very Large Integrated Circuit(VLSI) design flow intercon-&#xd;
nect delays are becoming major limiting factor for timing closure. Traditional placement&#xd;
algorithms such as routability-driven placement (improves routability) and wirelength-&#xd;
driven placement (reduces total wirelength) are no longer sufficient to close timing. To&#xd;
this end, timing-driven placement plays a crucial role in reducing the interconnect delay&#xd;
through timing critical paths (paths with timing violations/negative slacks) of the design&#xd;
and thereby achieving specific performance/clock frequency.&#xd;
&#xd;
In the placement flow, timing information about the design can be incorporated during&#xd;
global placement and/or incremental/detailed placement. Although, over the years, there&#xd;
has been significant advances in the quality of the global placement, there is a growing need&#xd;
for high performance incremental timing-driven placement due to the lack of accurate&#xd;
interconnect information during global placement. Moreover, incremental timing-driven&#xd;
placement is essential to recover timing while preserving the other optimization objectives&#xd;
such as total wirelength, routing congestion, and so forth which are optimized at the early&#xd;
stages of the design flow.&#xd;
&#xd;
This thesis proposes a simple, yet efficient, incremental timing-driven placement algo-&#xd;
rithm that seeks to find optimized locations for standard cells so that the total negative&#xd;
slack of the design can be maximized. Our algorithm consists two stages: (1) Global Move&#xd;
which positions standard cells inside a critical bounding box to eliminate timing violations&#xd;
on timing critical nets; and (2) Local Move which provides further timing improvement by&#xd;
finely adjusting the current locations of the standard cells within a local region.&#xd;
&#xd;
We evaluate our algorithm using ICCAD-2014 timing-driven placement contest bench-&#xd;
marks. The results show that, on average, our technique eliminates 94% and 30% of the&#xd;
late and early total negative slacks, respectively, and, 82% and 27% of the late and early&#xd;
worst negative slacks, respectively, under short and long displacement constraints. The&#xd;
1st-place team of the contest improves late and early total negative slacks by 90% and&#xd;
39%, respectively, and improves late and early worst negative slack by 76% and 32%, re-&#xd;
spectively. Taking into account both timing violation improvement and the placement&#xd;
quality (i.e., other objectives), on average, we outperform the 1st-place team by 3% in&#xd;
terms of the ICCAD-2014 contest quality score and our technique is 4.6× faster in terms&#xd;
of runtime.</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">Timing closure</dim:field>
   <dim:field mdschema="dc" element="subject">Timing-driven placement</dim:field>
   <dim:field mdschema="dc" element="subject">Placement density</dim:field>
   <dim:field mdschema="dc" element="subject">Static timing analysis</dim:field>
   <dim:field mdschema="dc" element="subject">Algorithm</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">Incremental Timing-Driven Placement with Displacement Constraint</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">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>